./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:57:02,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:57:02,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:57:02,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:57:02,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:57:02,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:57:02,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:57:02,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:57:02,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:57:02,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:57:02,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:57:02,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:57:02,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:57:02,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:57:02,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:57:02,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:57:02,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:57:02,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:57:02,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:57:02,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:57:02,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:57:02,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:57:02,256 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:57:02,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:57:02,257 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:57:02,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:57:02,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:57:02,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:57:02,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:57:02,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:57:02,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:57:02,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:02,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:57:02,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:57:02,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:57:02,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:57:02,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:57:02,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:57:02,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:57:02,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:57:02,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:57:02,273 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2024-11-19 05:57:02,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:57:02,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:57:02,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:57:02,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:57:02,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:57:02,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-11-19 05:57:04,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:57:04,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:57:04,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-11-19 05:57:04,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7308db072/b1804c83c6cb4885a0d3a462fa58fb40/FLAG5f2468351 [2024-11-19 05:57:04,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7308db072/b1804c83c6cb4885a0d3a462fa58fb40 [2024-11-19 05:57:04,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:57:04,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:57:04,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:04,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:57:04,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:57:04,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120918b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04, skipping insertion in model container [2024-11-19 05:57:04,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:57:04,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:04,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:57:04,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:04,607 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:57:04,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04 WrapperNode [2024-11-19 05:57:04,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:04,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:04,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:57:04,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:57:04,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,660 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2024-11-19 05:57:04,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:04,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:57:04,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:57:04,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:57:04,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:57:04,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:57:04,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:57:04,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:57:04,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (1/1) ... [2024-11-19 05:57:04,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:57:04,770 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-19 05:57:04,773 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-19 05:57:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:57:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:57:04,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:57:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:57:04,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:57:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:57:04,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:57:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:57:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:57:04,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:57:04,826 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:57:04,973 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:57:04,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:57:05,614 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:57:05,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:57:05,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:57:05,649 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:57:05,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:05 BoogieIcfgContainer [2024-11-19 05:57:05,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:57:05,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:57:05,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:57:05,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:57:05,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:57:04" (1/3) ... [2024-11-19 05:57:05,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:05, skipping insertion in model container [2024-11-19 05:57:05,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:04" (2/3) ... [2024-11-19 05:57:05,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:05, skipping insertion in model container [2024-11-19 05:57:05,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:05" (3/3) ... [2024-11-19 05:57:05,659 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2024-11-19 05:57:05,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:57:05,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-19 05:57:05,678 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:57:05,885 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:57:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 445 transitions, 911 flow [2024-11-19 05:57:06,142 INFO L124 PetriNetUnfolderBase]: 18/442 cut-off events. [2024-11-19 05:57:06,143 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:57:06,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 18/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-11-19 05:57:06,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 445 transitions, 911 flow [2024-11-19 05:57:06,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 421 transitions, 860 flow [2024-11-19 05:57:06,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:57:06,195 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;@f9afc97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:57:06,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-19 05:57:06,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:57:06,201 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-19 05:57:06,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:57:06,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:06,202 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] [2024-11-19 05:57:06,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:06,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 390371777, now seen corresponding path program 1 times [2024-11-19 05:57:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695666944] [2024-11-19 05:57:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:06,442 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-19 05:57:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695666944] [2024-11-19 05:57:06,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695666944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:06,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:06,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526306640] [2024-11-19 05:57:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:06,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:06,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:06,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:06,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-19 05:57:06,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:06,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-19 05:57:06,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:06,925 INFO L124 PetriNetUnfolderBase]: 20/802 cut-off events. [2024-11-19 05:57:06,927 INFO L125 PetriNetUnfolderBase]: For 22/26 co-relation queries the response was YES. [2024-11-19 05:57:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 802 events. 20/802 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2858 event pairs, 12 based on Foata normal form. 75/765 useless extension candidates. Maximal degree in co-relation 704. Up to 38 conditions per place. [2024-11-19 05:57:06,945 INFO L140 encePairwiseOnDemand]: 430/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-11-19 05:57:06,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 408 transitions, 864 flow [2024-11-19 05:57:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-19 05:57:06,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2024-11-19 05:57:06,972 INFO L175 Difference]: Start difference. First operand has 415 places, 421 transitions, 860 flow. Second operand 3 states and 1270 transitions. [2024-11-19 05:57:06,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 408 transitions, 864 flow [2024-11-19 05:57:06,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 408 transitions, 852 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:57:06,989 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 826 flow [2024-11-19 05:57:06,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2024-11-19 05:57:06,997 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -5 predicate places. [2024-11-19 05:57:06,998 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 826 flow [2024-11-19 05:57:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:07,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:07,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:07,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:57:07,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -547964183, now seen corresponding path program 1 times [2024-11-19 05:57:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017270807] [2024-11-19 05:57:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:07,090 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-19 05:57:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017270807] [2024-11-19 05:57:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017270807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907221747] [2024-11-19 05:57:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:07,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:07,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:07,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:07,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:07,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:07,287 INFO L124 PetriNetUnfolderBase]: 12/681 cut-off events. [2024-11-19 05:57:07,287 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:57:07,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 681 events. 12/681 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2562 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 677. Up to 22 conditions per place. [2024-11-19 05:57:07,301 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-11-19 05:57:07,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 407 transitions, 850 flow [2024-11-19 05:57:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:07,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:07,307 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 826 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:07,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 407 transitions, 850 flow [2024-11-19 05:57:07,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 407 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:07,318 INFO L231 Difference]: Finished difference. Result has 409 places, 407 transitions, 824 flow [2024-11-19 05:57:07,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=409, PETRI_TRANSITIONS=407} [2024-11-19 05:57:07,320 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -6 predicate places. [2024-11-19 05:57:07,320 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 407 transitions, 824 flow [2024-11-19 05:57:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:07,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:07,321 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:07,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:57:07,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:07,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1519254541, now seen corresponding path program 1 times [2024-11-19 05:57:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:07,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697038313] [2024-11-19 05:57:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:07,397 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-19 05:57:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697038313] [2024-11-19 05:57:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697038313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520874336] [2024-11-19 05:57:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:07,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:07,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:07,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:07,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:07,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:07,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:07,564 INFO L124 PetriNetUnfolderBase]: 12/671 cut-off events. [2024-11-19 05:57:07,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:57:07,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 671 events. 12/671 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2500 event pairs, 5 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2024-11-19 05:57:07,582 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2024-11-19 05:57:07,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 406 transitions, 848 flow [2024-11-19 05:57:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:07,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:07,588 INFO L175 Difference]: Start difference. First operand has 409 places, 407 transitions, 824 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:07,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 406 transitions, 848 flow [2024-11-19 05:57:07,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 406 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:07,595 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 822 flow [2024-11-19 05:57:07,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2024-11-19 05:57:07,597 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -7 predicate places. [2024-11-19 05:57:07,598 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 822 flow [2024-11-19 05:57:07,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:07,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:07,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:57:07,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 633941745, now seen corresponding path program 1 times [2024-11-19 05:57:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122411539] [2024-11-19 05:57:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:07,669 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-19 05:57:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122411539] [2024-11-19 05:57:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122411539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969200058] [2024-11-19 05:57:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:07,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:07,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-19 05:57:07,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:07,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:07,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-19 05:57:07,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:07,995 INFO L124 PetriNetUnfolderBase]: 34/1363 cut-off events. [2024-11-19 05:57:07,995 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-19 05:57:08,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1363 events. 34/1363 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6095 event pairs, 20 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1379. Up to 50 conditions per place. [2024-11-19 05:57:08,014 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2024-11-19 05:57:08,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 405 transitions, 850 flow [2024-11-19 05:57:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-19 05:57:08,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-11-19 05:57:08,018 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 822 flow. Second operand 3 states and 1258 transitions. [2024-11-19 05:57:08,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 405 transitions, 850 flow [2024-11-19 05:57:08,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 405 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:08,024 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 820 flow [2024-11-19 05:57:08,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-11-19 05:57:08,026 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -8 predicate places. [2024-11-19 05:57:08,026 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 820 flow [2024-11-19 05:57:08,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:08,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:08,028 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] [2024-11-19 05:57:08,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:57:08,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:08,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1120803467, now seen corresponding path program 1 times [2024-11-19 05:57:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834815225] [2024-11-19 05:57:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:08,090 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-19 05:57:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834815225] [2024-11-19 05:57:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834815225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577560998] [2024-11-19 05:57:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:08,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:08,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:08,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:08,277 INFO L124 PetriNetUnfolderBase]: 16/867 cut-off events. [2024-11-19 05:57:08,278 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-19 05:57:08,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 867 events. 16/867 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3219 event pairs, 7 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 844. Up to 25 conditions per place. [2024-11-19 05:57:08,299 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-11-19 05:57:08,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 844 flow [2024-11-19 05:57:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:08,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:08,302 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 820 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:08,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 844 flow [2024-11-19 05:57:08,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 404 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:08,310 INFO L231 Difference]: Finished difference. Result has 406 places, 404 transitions, 818 flow [2024-11-19 05:57:08,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=406, PETRI_TRANSITIONS=404} [2024-11-19 05:57:08,312 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-11-19 05:57:08,312 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 404 transitions, 818 flow [2024-11-19 05:57:08,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:08,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:08,313 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] [2024-11-19 05:57:08,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:57:08,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1040645728, now seen corresponding path program 1 times [2024-11-19 05:57:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675927390] [2024-11-19 05:57:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:08,403 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-19 05:57:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675927390] [2024-11-19 05:57:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675927390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110929162] [2024-11-19 05:57:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:08,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:08,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:08,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:08,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:08,618 INFO L124 PetriNetUnfolderBase]: 16/857 cut-off events. [2024-11-19 05:57:08,619 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-19 05:57:08,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 857 events. 16/857 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3182 event pairs, 7 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-11-19 05:57:08,637 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2024-11-19 05:57:08,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 403 transitions, 842 flow [2024-11-19 05:57:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:08,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:08,642 INFO L175 Difference]: Start difference. First operand has 406 places, 404 transitions, 818 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 403 transitions, 842 flow [2024-11-19 05:57:08,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:08,652 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 816 flow [2024-11-19 05:57:08,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2024-11-19 05:57:08,656 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-19 05:57:08,656 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 816 flow [2024-11-19 05:57:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:08,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:08,658 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] [2024-11-19 05:57:08,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:57:08,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 681543619, now seen corresponding path program 1 times [2024-11-19 05:57:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733021898] [2024-11-19 05:57:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:08,727 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-19 05:57:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733021898] [2024-11-19 05:57:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733021898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442782084] [2024-11-19 05:57:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:08,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-19 05:57:08,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:08,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-19 05:57:08,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:08,875 INFO L124 PetriNetUnfolderBase]: 27/638 cut-off events. [2024-11-19 05:57:08,876 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-11-19 05:57:08,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 638 events. 27/638 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 20 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 622. Up to 50 conditions per place. [2024-11-19 05:57:08,891 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:08,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 402 transitions, 844 flow [2024-11-19 05:57:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-19 05:57:08,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-11-19 05:57:08,896 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 816 flow. Second operand 3 states and 1258 transitions. [2024-11-19 05:57:08,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 402 transitions, 844 flow [2024-11-19 05:57:08,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:08,903 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 814 flow [2024-11-19 05:57:08,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2024-11-19 05:57:08,905 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-19 05:57:08,905 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 814 flow [2024-11-19 05:57:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-19 05:57:08,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:08,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:08,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:57:08,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash -475369336, now seen corresponding path program 1 times [2024-11-19 05:57:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506804749] [2024-11-19 05:57:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:08,953 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-19 05:57:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506804749] [2024-11-19 05:57:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506804749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534239886] [2024-11-19 05:57:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:08,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:08,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:08,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:08,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:08,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:08,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:08,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:09,103 INFO L124 PetriNetUnfolderBase]: 15/673 cut-off events. [2024-11-19 05:57:09,104 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-19 05:57:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 673 events. 15/673 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1777 event pairs, 7 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 623. Up to 25 conditions per place. [2024-11-19 05:57:09,116 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-19 05:57:09,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 838 flow [2024-11-19 05:57:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:09,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:09,119 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 814 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:09,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 838 flow [2024-11-19 05:57:09,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:09,126 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 812 flow [2024-11-19 05:57:09,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2024-11-19 05:57:09,130 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-19 05:57:09,131 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 812 flow [2024-11-19 05:57:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:09,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:57:09,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash -968794602, now seen corresponding path program 1 times [2024-11-19 05:57:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308324775] [2024-11-19 05:57:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,188 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-19 05:57:09,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308324775] [2024-11-19 05:57:09,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308324775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125623485] [2024-11-19 05:57:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-19 05:57:09,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:09,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-19 05:57:09,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:09,310 INFO L124 PetriNetUnfolderBase]: 15/663 cut-off events. [2024-11-19 05:57:09,310 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-19 05:57:09,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 663 events. 15/663 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1740 event pairs, 7 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 605. Up to 25 conditions per place. [2024-11-19 05:57:09,321 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-11-19 05:57:09,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 836 flow [2024-11-19 05:57:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:57:09,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-19 05:57:09,325 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 812 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:57:09,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 836 flow [2024-11-19 05:57:09,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:09,332 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 810 flow [2024-11-19 05:57:09,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-11-19 05:57:09,333 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-19 05:57:09,333 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 810 flow [2024-11-19 05:57:09,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-19 05:57:09,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:09,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:57:09,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:09,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 479133799, now seen corresponding path program 1 times [2024-11-19 05:57:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852680607] [2024-11-19 05:57:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,389 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-19 05:57:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852680607] [2024-11-19 05:57:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852680607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217031443] [2024-11-19 05:57:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:09,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-19 05:57:09,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:09,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:09,553 INFO L124 PetriNetUnfolderBase]: 21/852 cut-off events. [2024-11-19 05:57:09,553 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 05:57:09,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 852 events. 21/852 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3574 event pairs, 6 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 798. Up to 31 conditions per place. [2024-11-19 05:57:09,567 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:09,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 846 flow [2024-11-19 05:57:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:09,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:09,570 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 810 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:09,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 846 flow [2024-11-19 05:57:09,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:09,577 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 816 flow [2024-11-19 05:57:09,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2024-11-19 05:57:09,579 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-19 05:57:09,579 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 816 flow [2024-11-19 05:57:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-19 05:57:09,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:57:09,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 886112137, now seen corresponding path program 1 times [2024-11-19 05:57:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861324326] [2024-11-19 05:57:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,652 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-19 05:57:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861324326] [2024-11-19 05:57:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861324326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309054691] [2024-11-19 05:57:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:09,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-19 05:57:09,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:09,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:09,835 INFO L124 PetriNetUnfolderBase]: 24/1006 cut-off events. [2024-11-19 05:57:09,837 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:57:09,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1006 events. 24/1006 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4949 event pairs, 6 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 857. Up to 33 conditions per place. [2024-11-19 05:57:09,859 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:09,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 402 transitions, 852 flow [2024-11-19 05:57:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:09,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:09,862 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 816 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 402 transitions, 852 flow [2024-11-19 05:57:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:09,869 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2024-11-19 05:57:09,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-11-19 05:57:09,871 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-19 05:57:09,871 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2024-11-19 05:57:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-19 05:57:09,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:09,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:57:09,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:09,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1509085817, now seen corresponding path program 1 times [2024-11-19 05:57:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656175374] [2024-11-19 05:57:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,916 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-19 05:57:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656175374] [2024-11-19 05:57:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656175374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563567211] [2024-11-19 05:57:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:09,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:09,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:10,176 INFO L124 PetriNetUnfolderBase]: 44/1634 cut-off events. [2024-11-19 05:57:10,177 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-19 05:57:10,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1634 events. 44/1634 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10892 event pairs, 11 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2024-11-19 05:57:10,203 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:10,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 862 flow [2024-11-19 05:57:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:10,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:10,207 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:10,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 862 flow [2024-11-19 05:57:10,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:10,214 INFO L231 Difference]: Finished difference. Result has 403 places, 400 transitions, 836 flow [2024-11-19 05:57:10,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=403, PETRI_TRANSITIONS=400} [2024-11-19 05:57:10,216 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-19 05:57:10,216 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 400 transitions, 836 flow [2024-11-19 05:57:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:10,217 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:10,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:57:10,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440933, now seen corresponding path program 1 times [2024-11-19 05:57:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785076825] [2024-11-19 05:57:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:10,267 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-19 05:57:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785076825] [2024-11-19 05:57:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785076825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:10,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:10,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649271560] [2024-11-19 05:57:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:10,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:10,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:10,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 400 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:10,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:10,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:10,511 INFO L124 PetriNetUnfolderBase]: 42/1269 cut-off events. [2024-11-19 05:57:10,511 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-19 05:57:10,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1269 events. 42/1269 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7597 event pairs, 5 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1159. Up to 50 conditions per place. [2024-11-19 05:57:10,531 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:10,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 872 flow [2024-11-19 05:57:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:10,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:10,535 INFO L175 Difference]: Start difference. First operand has 403 places, 400 transitions, 836 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:10,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 872 flow [2024-11-19 05:57:10,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 402 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:10,542 INFO L231 Difference]: Finished difference. Result has 404 places, 400 transitions, 846 flow [2024-11-19 05:57:10,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=404, PETRI_TRANSITIONS=400} [2024-11-19 05:57:10,544 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-19 05:57:10,544 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 400 transitions, 846 flow [2024-11-19 05:57:10,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:10,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:57:10,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 651751019, now seen corresponding path program 1 times [2024-11-19 05:57:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047184402] [2024-11-19 05:57:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:10,593 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-19 05:57:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047184402] [2024-11-19 05:57:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047184402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661534748] [2024-11-19 05:57:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:10,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:10,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 400 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:10,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:10,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:10,888 INFO L124 PetriNetUnfolderBase]: 61/1652 cut-off events. [2024-11-19 05:57:10,889 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2024-11-19 05:57:10,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1652 events. 61/1652 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9967 event pairs, 18 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1523. Up to 70 conditions per place. [2024-11-19 05:57:10,910 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:10,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 882 flow [2024-11-19 05:57:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:10,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:10,914 INFO L175 Difference]: Start difference. First operand has 404 places, 400 transitions, 846 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 882 flow [2024-11-19 05:57:10,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:10,922 INFO L231 Difference]: Finished difference. Result has 405 places, 400 transitions, 856 flow [2024-11-19 05:57:10,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2024-11-19 05:57:10,924 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-19 05:57:10,924 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 856 flow [2024-11-19 05:57:10,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:10,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:10,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:57:10,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:10,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -732459891, now seen corresponding path program 1 times [2024-11-19 05:57:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965982246] [2024-11-19 05:57:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:10,979 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-19 05:57:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965982246] [2024-11-19 05:57:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965982246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830382158] [2024-11-19 05:57:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:10,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-19 05:57:10,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:10,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:10,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-19 05:57:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:11,313 INFO L124 PetriNetUnfolderBase]: 70/1820 cut-off events. [2024-11-19 05:57:11,314 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2024-11-19 05:57:11,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1820 events. 70/1820 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11195 event pairs, 10 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 1718. Up to 80 conditions per place. [2024-11-19 05:57:11,349 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-19 05:57:11,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 402 transitions, 892 flow [2024-11-19 05:57:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:11,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:11,353 INFO L175 Difference]: Start difference. First operand has 405 places, 400 transitions, 856 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:11,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 402 transitions, 892 flow [2024-11-19 05:57:11,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 402 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:11,361 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 866 flow [2024-11-19 05:57:11,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2024-11-19 05:57:11,364 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-11-19 05:57:11,364 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 866 flow [2024-11-19 05:57:11,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-19 05:57:11,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:11,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:11,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:57:11,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:11,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash 212449739, now seen corresponding path program 1 times [2024-11-19 05:57:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:11,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061345742] [2024-11-19 05:57:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:11,418 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-19 05:57:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:11,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061345742] [2024-11-19 05:57:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061345742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894855342] [2024-11-19 05:57:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:11,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:11,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-19 05:57:11,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-19 05:57:11,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:11,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-19 05:57:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:11,737 INFO L124 PetriNetUnfolderBase]: 178/1862 cut-off events. [2024-11-19 05:57:11,737 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 05:57:11,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1862 events. 178/1862 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13026 event pairs, 84 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 1917. Up to 293 conditions per place. [2024-11-19 05:57:11,772 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-11-19 05:57:11,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 906 flow [2024-11-19 05:57:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-19 05:57:11,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-19 05:57:11,776 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 866 flow. Second operand 3 states and 1259 transitions. [2024-11-19 05:57:11,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 906 flow [2024-11-19 05:57:11,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 400 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:11,785 INFO L231 Difference]: Finished difference. Result has 405 places, 398 transitions, 872 flow [2024-11-19 05:57:11,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2024-11-19 05:57:11,786 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-19 05:57:11,786 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 872 flow [2024-11-19 05:57:11,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-19 05:57:11,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:11,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:11,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:57:11,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1994196883, now seen corresponding path program 1 times [2024-11-19 05:57:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:11,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754814745] [2024-11-19 05:57:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:11,843 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-19 05:57:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754814745] [2024-11-19 05:57:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754814745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704977614] [2024-11-19 05:57:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:11,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:11,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-19 05:57:11,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-19 05:57:11,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:11,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-19 05:57:11,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:12,128 INFO L124 PetriNetUnfolderBase]: 123/1527 cut-off events. [2024-11-19 05:57:12,128 INFO L125 PetriNetUnfolderBase]: For 12/42 co-relation queries the response was YES. [2024-11-19 05:57:12,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1527 events. 123/1527 cut-off events. For 12/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9568 event pairs, 28 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 1543. Up to 152 conditions per place. [2024-11-19 05:57:12,153 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2024-11-19 05:57:12,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 398 transitions, 912 flow [2024-11-19 05:57:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-19 05:57:12,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-19 05:57:12,157 INFO L175 Difference]: Start difference. First operand has 405 places, 398 transitions, 872 flow. Second operand 3 states and 1259 transitions. [2024-11-19 05:57:12,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 398 transitions, 912 flow [2024-11-19 05:57:12,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 398 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:12,163 INFO L231 Difference]: Finished difference. Result has 404 places, 396 transitions, 878 flow [2024-11-19 05:57:12,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2024-11-19 05:57:12,164 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-19 05:57:12,164 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 878 flow [2024-11-19 05:57:12,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-19 05:57:12,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:12,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:57:12,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1779658794, now seen corresponding path program 1 times [2024-11-19 05:57:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608558858] [2024-11-19 05:57:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:12,210 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-19 05:57:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608558858] [2024-11-19 05:57:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608558858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902731601] [2024-11-19 05:57:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:12,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:12,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-19 05:57:12,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-19 05:57:12,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:12,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-19 05:57:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:12,474 INFO L124 PetriNetUnfolderBase]: 60/1524 cut-off events. [2024-11-19 05:57:12,475 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2024-11-19 05:57:12,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1524 events. 60/1524 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8498 event pairs, 8 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 1416. Up to 38 conditions per place. [2024-11-19 05:57:12,490 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-19 05:57:12,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 397 transitions, 908 flow [2024-11-19 05:57:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:12,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:12,493 INFO L175 Difference]: Start difference. First operand has 404 places, 396 transitions, 878 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:12,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 397 transitions, 908 flow [2024-11-19 05:57:12,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 397 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:12,500 INFO L231 Difference]: Finished difference. Result has 405 places, 395 transitions, 880 flow [2024-11-19 05:57:12,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=405, PETRI_TRANSITIONS=395} [2024-11-19 05:57:12,501 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-19 05:57:12,502 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 880 flow [2024-11-19 05:57:12,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-19 05:57:12,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:12,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:57:12,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 651125951, now seen corresponding path program 1 times [2024-11-19 05:57:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661868106] [2024-11-19 05:57:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:12,555 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-19 05:57:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661868106] [2024-11-19 05:57:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661868106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921509728] [2024-11-19 05:57:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:12,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:12,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:12,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:12,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-19 05:57:12,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-19 05:57:12,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:12,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-19 05:57:12,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:12,876 INFO L124 PetriNetUnfolderBase]: 222/1927 cut-off events. [2024-11-19 05:57:12,877 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2024-11-19 05:57:12,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1927 events. 222/1927 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12369 event pairs, 76 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 2166. Up to 346 conditions per place. [2024-11-19 05:57:12,908 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-11-19 05:57:12,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 395 transitions, 920 flow [2024-11-19 05:57:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-19 05:57:12,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-19 05:57:12,912 INFO L175 Difference]: Start difference. First operand has 405 places, 395 transitions, 880 flow. Second operand 3 states and 1259 transitions. [2024-11-19 05:57:12,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 395 transitions, 920 flow [2024-11-19 05:57:12,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 395 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:12,920 INFO L231 Difference]: Finished difference. Result has 402 places, 393 transitions, 882 flow [2024-11-19 05:57:12,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=393} [2024-11-19 05:57:12,921 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-19 05:57:12,922 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 393 transitions, 882 flow [2024-11-19 05:57:12,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-19 05:57:12,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:12,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:12,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:57:12,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:12,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -82359832, now seen corresponding path program 1 times [2024-11-19 05:57:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:12,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193130958] [2024-11-19 05:57:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:12,988 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-19 05:57:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193130958] [2024-11-19 05:57:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193130958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190551084] [2024-11-19 05:57:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:13,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-19 05:57:13,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 393 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-19 05:57:13,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:13,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-19 05:57:13,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,332 INFO L124 PetriNetUnfolderBase]: 66/1560 cut-off events. [2024-11-19 05:57:13,333 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2024-11-19 05:57:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1560 events. 66/1560 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8750 event pairs, 6 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 1593. Up to 48 conditions per place. [2024-11-19 05:57:13,364 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-11-19 05:57:13,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 912 flow [2024-11-19 05:57:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:13,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:13,368 INFO L175 Difference]: Start difference. First operand has 402 places, 393 transitions, 882 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:13,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 912 flow [2024-11-19 05:57:13,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 394 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:13,376 INFO L231 Difference]: Finished difference. Result has 403 places, 392 transitions, 884 flow [2024-11-19 05:57:13,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=403, PETRI_TRANSITIONS=392} [2024-11-19 05:57:13,377 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-19 05:57:13,377 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 392 transitions, 884 flow [2024-11-19 05:57:13,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-19 05:57:13,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:13,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:13,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:57:13,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1144087775, now seen corresponding path program 1 times [2024-11-19 05:57:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882289119] [2024-11-19 05:57:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:13,436 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-19 05:57:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882289119] [2024-11-19 05:57:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882289119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097096540] [2024-11-19 05:57:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:13,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:13,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-19 05:57:13,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 392 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-19 05:57:13,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:13,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-19 05:57:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,648 INFO L124 PetriNetUnfolderBase]: 74/1231 cut-off events. [2024-11-19 05:57:13,649 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2024-11-19 05:57:13,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1231 events. 74/1231 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6257 event pairs, 14 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1475. Up to 76 conditions per place. [2024-11-19 05:57:13,671 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-19 05:57:13,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 914 flow [2024-11-19 05:57:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-19 05:57:13,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-19 05:57:13,674 INFO L175 Difference]: Start difference. First operand has 403 places, 392 transitions, 884 flow. Second operand 3 states and 1271 transitions. [2024-11-19 05:57:13,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 914 flow [2024-11-19 05:57:13,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 393 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:13,681 INFO L231 Difference]: Finished difference. Result has 402 places, 391 transitions, 882 flow [2024-11-19 05:57:13,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=391} [2024-11-19 05:57:13,682 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-19 05:57:13,682 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 391 transitions, 882 flow [2024-11-19 05:57:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-19 05:57:13,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:13,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:13,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:57:13,684 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -551136353, now seen corresponding path program 1 times [2024-11-19 05:57:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592191971] [2024-11-19 05:57:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:13,778 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-19 05:57:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592191971] [2024-11-19 05:57:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592191971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:13,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401621803] [2024-11-19 05:57:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:13,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:13,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-19 05:57:13,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 391 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:13,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:13,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-19 05:57:13,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,031 INFO L124 PetriNetUnfolderBase]: 60/1538 cut-off events. [2024-11-19 05:57:14,031 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-11-19 05:57:14,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1538 events. 60/1538 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8400 event pairs, 4 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1589. Up to 50 conditions per place. [2024-11-19 05:57:14,060 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2024-11-19 05:57:14,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 390 transitions, 898 flow [2024-11-19 05:57:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-11-19 05:57:14,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-11-19 05:57:14,063 INFO L175 Difference]: Start difference. First operand has 402 places, 391 transitions, 882 flow. Second operand 3 states and 1273 transitions. [2024-11-19 05:57:14,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 390 transitions, 898 flow [2024-11-19 05:57:14,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 390 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:14,071 INFO L231 Difference]: Finished difference. Result has 401 places, 390 transitions, 878 flow [2024-11-19 05:57:14,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=401, PETRI_TRANSITIONS=390} [2024-11-19 05:57:14,073 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-19 05:57:14,073 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 390 transitions, 878 flow [2024-11-19 05:57:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:14,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:57:14,074 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -592800542, now seen corresponding path program 1 times [2024-11-19 05:57:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440035069] [2024-11-19 05:57:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,159 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-19 05:57:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440035069] [2024-11-19 05:57:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440035069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530547149] [2024-11-19 05:57:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-19 05:57:14,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 390 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:14,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-19 05:57:14,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,417 INFO L124 PetriNetUnfolderBase]: 56/1511 cut-off events. [2024-11-19 05:57:14,418 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-11-19 05:57:14,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1511 events. 56/1511 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8189 event pairs, 3 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1698. Up to 48 conditions per place. [2024-11-19 05:57:14,444 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2024-11-19 05:57:14,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 389 transitions, 894 flow [2024-11-19 05:57:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-11-19 05:57:14,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-11-19 05:57:14,447 INFO L175 Difference]: Start difference. First operand has 401 places, 390 transitions, 878 flow. Second operand 3 states and 1273 transitions. [2024-11-19 05:57:14,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 389 transitions, 894 flow [2024-11-19 05:57:14,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 389 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:14,453 INFO L231 Difference]: Finished difference. Result has 401 places, 389 transitions, 877 flow [2024-11-19 05:57:14,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2024-11-19 05:57:14,455 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-19 05:57:14,455 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 877 flow [2024-11-19 05:57:14,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:14,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:14,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:57:14,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 05:57:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash -933491653, now seen corresponding path program 1 times [2024-11-19 05:57:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741357873] [2024-11-19 05:57:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,563 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-19 05:57:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741357873] [2024-11-19 05:57:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741357873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063199675] [2024-11-19 05:57:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-19 05:57:14,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:14,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-19 05:57:14,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,751 INFO L124 PetriNetUnfolderBase]: 52/1170 cut-off events. [2024-11-19 05:57:14,751 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-19 05:57:14,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1170 events. 52/1170 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5778 event pairs, 7 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 1358. Up to 42 conditions per place. [2024-11-19 05:57:14,773 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 0 selfloop transitions, 0 changer transitions 388/388 dead transitions. [2024-11-19 05:57:14,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 388 transitions, 891 flow [2024-11-19 05:57:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2024-11-19 05:57:14,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952808988764045 [2024-11-19 05:57:14,776 INFO L175 Difference]: Start difference. First operand has 401 places, 389 transitions, 877 flow. Second operand 3 states and 1272 transitions. [2024-11-19 05:57:14,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 388 transitions, 891 flow [2024-11-19 05:57:14,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 388 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:14,781 INFO L231 Difference]: Finished difference. Result has 401 places, 0 transitions, 0 flow [2024-11-19 05:57:14,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=401, PETRI_TRANSITIONS=0} [2024-11-19 05:57:14,782 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-19 05:57:14,782 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 0 transitions, 0 flow [2024-11-19 05:57:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-19 05:57:14,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2024-11-19 05:57:14,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2024-11-19 05:57:14,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2024-11-19 05:57:14,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2024-11-19 05:57:14,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2024-11-19 05:57:14,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2024-11-19 05:57:14,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2024-11-19 05:57:14,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2024-11-19 05:57:14,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2024-11-19 05:57:14,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2024-11-19 05:57:14,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2024-11-19 05:57:14,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2024-11-19 05:57:14,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2024-11-19 05:57:14,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2024-11-19 05:57:14,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:57:14,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:14,806 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:14,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:14,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:14 BasicIcfg [2024-11-19 05:57:14,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:14,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:14,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:14,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:14,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:05" (3/4) ... [2024-11-19 05:57:14,818 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:14,823 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:14,823 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:14,823 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:57:14,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 05:57:14,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:14,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:14,831 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:14,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:14,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:14,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:14,940 INFO L158 Benchmark]: Toolchain (without parser) took 10671.25ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 99.6MB in the beginning and 362.2MB in the end (delta: -262.6MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,940 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:14,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.90ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 85.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,941 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 80.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,941 INFO L158 Benchmark]: RCFGBuilder took 935.07ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 51.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,941 INFO L158 Benchmark]: TraceAbstraction took 9163.71ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 50.6MB in the beginning and 368.5MB in the end (delta: -317.9MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,942 INFO L158 Benchmark]: Witness Printer took 123.38ms. Allocated memory is still 532.7MB. Free memory was 368.5MB in the beginning and 362.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:57:14,943 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.27ms. Allocated memory is still 157.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.90ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 85.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 80.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 935.07ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 51.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9163.71ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 50.6MB in the beginning and 368.5MB in the end (delta: -317.9MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Witness Printer took 123.38ms. Allocated memory is still 532.7MB. Free memory was 368.5MB in the beginning and 362.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 701 locations, 69 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: 8.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 102 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:14,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE