./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-subst.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-exp-term-subst.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 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:52,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:52,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:52,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:52,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:52,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:52,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:52,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:52,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:52,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:52,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:52,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:52,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:52,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:52,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:52,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:52,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:52,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:52,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:52,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:52,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:52,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:52,144 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:52,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:52,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:52,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:52,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:52,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:52,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:52,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:52,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:52,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:52,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:52,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:52,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:52,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:52,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:52,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:52,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:52,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:52,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:52,150 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 -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2024-11-19 05:56:52,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:52,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:52,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:52,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:52,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:52,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-19 05:56:53,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:53,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:53,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-19 05:56:53,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55097957/f8d2425275ed4516a60d5f095486ca0a/FLAG9e726b9ad [2024-11-19 05:56:54,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55097957/f8d2425275ed4516a60d5f095486ca0a [2024-11-19 05:56:54,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:54,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:54,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:54,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:54,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:54,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157abd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54, skipping insertion in model container [2024-11-19 05:56:54,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:54,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:54,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:54,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:54,460 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:54,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54 WrapperNode [2024-11-19 05:56:54,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:54,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:54,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:54,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:54,469 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:56:54" (1/1) ... [2024-11-19 05:56:54,485 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:56:54" (1/1) ... [2024-11-19 05:56:54,530 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2024-11-19 05:56:54,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:54,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:54,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:54,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:54,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:54,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:54,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:54,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:54,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (1/1) ... [2024-11-19 05:56:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:54,622 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:56:54,628 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:56:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:54,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:54,670 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:56:54,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:54,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:55,224 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:55,224 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:55,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:55,242 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:56:55,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:55 BoogieIcfgContainer [2024-11-19 05:56:55,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:55,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:55,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:55,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:55,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:54" (1/3) ... [2024-11-19 05:56:55,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d041a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:55, skipping insertion in model container [2024-11-19 05:56:55,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:54" (2/3) ... [2024-11-19 05:56:55,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d041a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:55, skipping insertion in model container [2024-11-19 05:56:55,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:55" (3/3) ... [2024-11-19 05:56:55,249 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-11-19 05:56:55,272 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:55,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-19 05:56:55,272 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:55,455 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:56:55,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 430 transitions, 881 flow [2024-11-19 05:56:55,606 INFO L124 PetriNetUnfolderBase]: 27/427 cut-off events. [2024-11-19 05:56:55,606 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:55,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 427 events. 27/427 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1395 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2024-11-19 05:56:55,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 430 transitions, 881 flow [2024-11-19 05:56:55,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 832 flow [2024-11-19 05:56:55,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:55,653 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;@88fd1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:55,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-11-19 05:56:55,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:55,657 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:56:55,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:55,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:55,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] [2024-11-19 05:56:55,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1102699124, now seen corresponding path program 1 times [2024-11-19 05:56:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121086676] [2024-11-19 05:56:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:55,816 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:56:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121086676] [2024-11-19 05:56:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121086676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:55,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390685005] [2024-11-19 05:56:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:55,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:55,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:55,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:55,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-19 05:56:55,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:55,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:55,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-19 05:56:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:56,162 INFO L124 PetriNetUnfolderBase]: 98/1397 cut-off events. [2024-11-19 05:56:56,163 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-11-19 05:56:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1397 events. 98/1397 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9754 event pairs, 20 based on Foata normal form. 39/1169 useless extension candidates. Maximal degree in co-relation 1352. Up to 50 conditions per place. [2024-11-19 05:56:56,189 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 13 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2024-11-19 05:56:56,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 846 flow [2024-11-19 05:56:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2024-11-19 05:56:56,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9573643410852714 [2024-11-19 05:56:56,212 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 832 flow. Second operand 3 states and 1235 transitions. [2024-11-19 05:56:56,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 846 flow [2024-11-19 05:56:56,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 834 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:56,227 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 806 flow [2024-11-19 05:56:56,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2024-11-19 05:56:56,232 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -5 predicate places. [2024-11-19 05:56:56,233 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 806 flow [2024-11-19 05:56:56,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:56,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:56,234 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] [2024-11-19 05:56:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:56,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:56,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash 669304532, now seen corresponding path program 1 times [2024-11-19 05:56:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332239287] [2024-11-19 05:56:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:56,300 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:56:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332239287] [2024-11-19 05:56:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332239287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923944522] [2024-11-19 05:56:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:56,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:56,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-19 05:56:56,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:56,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:56,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-19 05:56:56,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:56,445 INFO L124 PetriNetUnfolderBase]: 54/807 cut-off events. [2024-11-19 05:56:56,445 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:56:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 54/807 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4622 event pairs, 12 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 824. Up to 38 conditions per place. [2024-11-19 05:56:56,458 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-19 05:56:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 397 transitions, 834 flow [2024-11-19 05:56:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-19 05:56:56,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-19 05:56:56,461 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 806 flow. Second operand 3 states and 1228 transitions. [2024-11-19 05:56:56,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 397 transitions, 834 flow [2024-11-19 05:56:56,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:56,467 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 804 flow [2024-11-19 05:56:56,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2024-11-19 05:56:56,468 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2024-11-19 05:56:56,468 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 804 flow [2024-11-19 05:56:56,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:56,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:56,469 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] [2024-11-19 05:56:56,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:56,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:56,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:56,470 INFO L85 PathProgramCache]: Analyzing trace with hash -337939069, now seen corresponding path program 1 times [2024-11-19 05:56:56,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:56,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126198898] [2024-11-19 05:56:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:56,504 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:56:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126198898] [2024-11-19 05:56:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126198898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264630046] [2024-11-19 05:56:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:56,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:56,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-19 05:56:56,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:56,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:56,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-19 05:56:56,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:56,623 INFO L124 PetriNetUnfolderBase]: 50/620 cut-off events. [2024-11-19 05:56:56,624 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-11-19 05:56:56,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 620 events. 50/620 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3102 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 639. Up to 50 conditions per place. [2024-11-19 05:56:56,640 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-11-19 05:56:56,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 396 transitions, 832 flow [2024-11-19 05:56:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-19 05:56:56,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-19 05:56:56,643 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 804 flow. Second operand 3 states and 1228 transitions. [2024-11-19 05:56:56,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 396 transitions, 832 flow [2024-11-19 05:56:56,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 396 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:56,666 INFO L231 Difference]: Finished difference. Result has 384 places, 396 transitions, 802 flow [2024-11-19 05:56:56,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=384, PETRI_TRANSITIONS=396} [2024-11-19 05:56:56,668 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2024-11-19 05:56:56,668 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 396 transitions, 802 flow [2024-11-19 05:56:56,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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:56:56,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:56,669 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:56,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:56,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1034750040, now seen corresponding path program 1 times [2024-11-19 05:56:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416204585] [2024-11-19 05:56:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:56,744 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:56:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416204585] [2024-11-19 05:56:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416204585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367557920] [2024-11-19 05:56:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:56,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:56,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:56,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:56:56,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:56,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:56,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:56:56,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:57,016 INFO L124 PetriNetUnfolderBase]: 117/1364 cut-off events. [2024-11-19 05:56:57,016 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 05:56:57,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1364 events. 117/1364 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9907 event pairs, 39 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1426. Up to 85 conditions per place. [2024-11-19 05:56:57,054 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-11-19 05:56:57,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 395 transitions, 834 flow [2024-11-19 05:56:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-19 05:56:57,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-19 05:56:57,058 INFO L175 Difference]: Start difference. First operand has 384 places, 396 transitions, 802 flow. Second operand 3 states and 1224 transitions. [2024-11-19 05:56:57,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 395 transitions, 834 flow [2024-11-19 05:56:57,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:57,063 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 800 flow [2024-11-19 05:56:57,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=381, 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=800, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2024-11-19 05:56:57,065 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -9 predicate places. [2024-11-19 05:56:57,065 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 800 flow [2024-11-19 05:56:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:57,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:57,067 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] [2024-11-19 05:56:57,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:57,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1308583354, now seen corresponding path program 1 times [2024-11-19 05:56:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599737625] [2024-11-19 05:56:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:57,117 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:56:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599737625] [2024-11-19 05:56:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599737625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142103073] [2024-11-19 05:56:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:57,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:56:57,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:57,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:57,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:56:57,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:57,280 INFO L124 PetriNetUnfolderBase]: 69/871 cut-off events. [2024-11-19 05:56:57,280 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:57,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 871 events. 69/871 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5269 event pairs, 21 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 886. Up to 58 conditions per place. [2024-11-19 05:56:57,298 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-11-19 05:56:57,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 832 flow [2024-11-19 05:56:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-19 05:56:57,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-19 05:56:57,300 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 800 flow. Second operand 3 states and 1224 transitions. [2024-11-19 05:56:57,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 832 flow [2024-11-19 05:56:57,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:57,308 INFO L231 Difference]: Finished difference. Result has 382 places, 394 transitions, 798 flow [2024-11-19 05:56:57,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=382, PETRI_TRANSITIONS=394} [2024-11-19 05:56:57,309 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2024-11-19 05:56:57,310 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 394 transitions, 798 flow [2024-11-19 05:56:57,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:57,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:57,312 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] [2024-11-19 05:56:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:57,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1633748031, now seen corresponding path program 1 times [2024-11-19 05:56:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552609912] [2024-11-19 05:56:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:57,380 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:56:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552609912] [2024-11-19 05:56:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552609912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878701028] [2024-11-19 05:56:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:57,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:57,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:56:57,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:57,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:57,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:56:57,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:57,561 INFO L124 PetriNetUnfolderBase]: 117/1332 cut-off events. [2024-11-19 05:56:57,562 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2024-11-19 05:56:57,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1332 events. 117/1332 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8607 event pairs, 39 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1363. Up to 85 conditions per place. [2024-11-19 05:56:57,590 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-19 05:56:57,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 393 transitions, 830 flow [2024-11-19 05:56:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-19 05:56:57,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-19 05:56:57,592 INFO L175 Difference]: Start difference. First operand has 382 places, 394 transitions, 798 flow. Second operand 3 states and 1224 transitions. [2024-11-19 05:56:57,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 393 transitions, 830 flow [2024-11-19 05:56:57,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 393 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:57,598 INFO L231 Difference]: Finished difference. Result has 381 places, 393 transitions, 796 flow [2024-11-19 05:56:57,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=393} [2024-11-19 05:56:57,599 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-19 05:56:57,599 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 393 transitions, 796 flow [2024-11-19 05:56:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:57,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:57,601 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:57,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1920223402, now seen corresponding path program 1 times [2024-11-19 05:56:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595497529] [2024-11-19 05:56:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:57,649 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:56:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595497529] [2024-11-19 05:56:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595497529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222482383] [2024-11-19 05:56:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:57,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:57,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-19 05:56:57,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 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:56:57,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:57,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-19 05:56:57,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:57,946 INFO L124 PetriNetUnfolderBase]: 284/2636 cut-off events. [2024-11-19 05:56:57,946 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:56:57,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2636 events. 284/2636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24560 event pairs, 117 based on Foata normal form. 0/2193 useless extension candidates. Maximal degree in co-relation 2879. Up to 251 conditions per place. [2024-11-19 05:56:57,990 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2024-11-19 05:56:57,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 840 flow [2024-11-19 05:56:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-19 05:56:57,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-19 05:56:57,993 INFO L175 Difference]: Start difference. First operand has 381 places, 393 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-19 05:56:57,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 840 flow [2024-11-19 05:56:57,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:57,999 INFO L231 Difference]: Finished difference. Result has 376 places, 389 transitions, 794 flow [2024-11-19 05:56:57,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=376, PETRI_TRANSITIONS=389} [2024-11-19 05:56:58,000 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-11-19 05:56:58,001 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 389 transitions, 794 flow [2024-11-19 05:56:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 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:56:58,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:58,002 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:56:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:58,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:58,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1501280024, now seen corresponding path program 1 times [2024-11-19 05:56:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804226285] [2024-11-19 05:56:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:58,043 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:56:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:58,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804226285] [2024-11-19 05:56:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804226285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531879794] [2024-11-19 05:56:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:58,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-19 05:56:58,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 389 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 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:56:58,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:58,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-19 05:56:58,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:58,247 INFO L124 PetriNetUnfolderBase]: 151/1516 cut-off events. [2024-11-19 05:56:58,248 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 05:56:58,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1516 events. 151/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11431 event pairs, 52 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1504. Up to 135 conditions per place. [2024-11-19 05:56:58,278 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-11-19 05:56:58,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 387 transitions, 838 flow [2024-11-19 05:56:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-19 05:56:58,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-19 05:56:58,280 INFO L175 Difference]: Start difference. First operand has 376 places, 389 transitions, 794 flow. Second operand 3 states and 1217 transitions. [2024-11-19 05:56:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 387 transitions, 838 flow [2024-11-19 05:56:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 387 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:58,285 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 796 flow [2024-11-19 05:56:58,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-19 05:56:58,287 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-19 05:56:58,287 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 796 flow [2024-11-19 05:56:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 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:56:58,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:58,288 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:58,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:58,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1400118740, now seen corresponding path program 1 times [2024-11-19 05:56:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413841496] [2024-11-19 05:56:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:58,319 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:56:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413841496] [2024-11-19 05:56:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413841496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:58,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791532148] [2024-11-19 05:56:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:58,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:58,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:58,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:58,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-19 05:56:58,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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:56:58,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:58,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-19 05:56:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:58,762 INFO L124 PetriNetUnfolderBase]: 505/4357 cut-off events. [2024-11-19 05:56:58,762 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-19 05:56:58,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 4357 events. 505/4357 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44552 event pairs, 126 based on Foata normal form. 0/3687 useless extension candidates. Maximal degree in co-relation 3641. Up to 445 conditions per place. [2024-11-19 05:56:58,799 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-11-19 05:56:58,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 383 transitions, 840 flow [2024-11-19 05:56:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-19 05:56:58,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-19 05:56:58,802 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-19 05:56:58,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 383 transitions, 840 flow [2024-11-19 05:56:58,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 383 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:58,807 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 798 flow [2024-11-19 05:56:58,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-19 05:56:58,808 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-19 05:56:58,808 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 798 flow [2024-11-19 05:56:58,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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:56:58,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:58,809 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:56:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:58,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1481210219, now seen corresponding path program 1 times [2024-11-19 05:56:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958235034] [2024-11-19 05:56:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:58,840 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:56:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:58,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958235034] [2024-11-19 05:56:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958235034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732177380] [2024-11-19 05:56:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:58,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:58,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:58,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:56:58,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 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:56:58,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:58,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:56:58,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:59,037 INFO L124 PetriNetUnfolderBase]: 98/1285 cut-off events. [2024-11-19 05:56:59,038 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:59,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1285 events. 98/1285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9496 event pairs, 10 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1124. Up to 35 conditions per place. [2024-11-19 05:56:59,052 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-19 05:56:59,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 385 transitions, 842 flow [2024-11-19 05:56:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-19 05:56:59,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-19 05:56:59,055 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 798 flow. Second operand 3 states and 1242 transitions. [2024-11-19 05:56:59,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 385 transitions, 842 flow [2024-11-19 05:56:59,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:59,061 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 820 flow [2024-11-19 05:56:59,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2024-11-19 05:56:59,063 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2024-11-19 05:56:59,064 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 820 flow [2024-11-19 05:56:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 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:56:59,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:59,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:59,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:59,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:59,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 955479565, now seen corresponding path program 1 times [2024-11-19 05:56:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354556011] [2024-11-19 05:56:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:59,103 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:56:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354556011] [2024-11-19 05:56:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354556011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:59,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554135665] [2024-11-19 05:56:59,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:59,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:56:59,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:59,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:59,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:56:59,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:59,440 INFO L124 PetriNetUnfolderBase]: 206/2208 cut-off events. [2024-11-19 05:56:59,440 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2024-11-19 05:56:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 2208 events. 206/2208 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19276 event pairs, 16 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 2113. Up to 166 conditions per place. [2024-11-19 05:56:59,459 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-19 05:56:59,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 883 flow [2024-11-19 05:56:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-19 05:56:59,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-19 05:56:59,462 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 820 flow. Second operand 3 states and 1234 transitions. [2024-11-19 05:56:59,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 883 flow [2024-11-19 05:56:59,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 388 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:59,467 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 834 flow [2024-11-19 05:56:59,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-19 05:56:59,468 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-19 05:56:59,468 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 834 flow [2024-11-19 05:56:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:59,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:59,469 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] [2024-11-19 05:56:59,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:59,470 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:59,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash -907105805, now seen corresponding path program 1 times [2024-11-19 05:56:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:59,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761665727] [2024-11-19 05:56:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:59,514 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:56:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761665727] [2024-11-19 05:56:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761665727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774817644] [2024-11-19 05:56:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:59,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:59,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:56:59,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:59,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:59,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:56:59,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:59,900 INFO L124 PetriNetUnfolderBase]: 262/2943 cut-off events. [2024-11-19 05:56:59,900 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2024-11-19 05:56:59,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2943 events. 262/2943 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26403 event pairs, 36 based on Foata normal form. 2/2571 useless extension candidates. Maximal degree in co-relation 2942. Up to 198 conditions per place. [2024-11-19 05:56:59,931 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-19 05:56:59,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 388 transitions, 897 flow [2024-11-19 05:56:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-19 05:56:59,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-19 05:56:59,934 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 834 flow. Second operand 3 states and 1234 transitions. [2024-11-19 05:56:59,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 388 transitions, 897 flow [2024-11-19 05:56:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 388 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:59,939 INFO L231 Difference]: Finished difference. Result has 370 places, 383 transitions, 854 flow [2024-11-19 05:56:59,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=383} [2024-11-19 05:56:59,941 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-19 05:56:59,942 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 383 transitions, 854 flow [2024-11-19 05:56:59,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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:56:59,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:59,943 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] [2024-11-19 05:56:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:59,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:56:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1268745015, now seen corresponding path program 1 times [2024-11-19 05:56:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819218823] [2024-11-19 05:56:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:59,975 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:56:59,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:59,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819218823] [2024-11-19 05:56:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819218823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:59,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542924471] [2024-11-19 05:56:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:59,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:59,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 430 [2024-11-19 05:56:59,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 383 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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:56:59,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:59,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 430 [2024-11-19 05:56:59,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:00,326 INFO L124 PetriNetUnfolderBase]: 236/2977 cut-off events. [2024-11-19 05:57:00,327 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2024-11-19 05:57:00,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 2977 events. 236/2977 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27839 event pairs, 14 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 2968. Up to 62 conditions per place. [2024-11-19 05:57:00,364 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-11-19 05:57:00,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 884 flow [2024-11-19 05:57:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2024-11-19 05:57:00,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962015503875969 [2024-11-19 05:57:00,370 INFO L175 Difference]: Start difference. First operand has 370 places, 383 transitions, 854 flow. Second operand 3 states and 1241 transitions. [2024-11-19 05:57:00,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 384 transitions, 884 flow [2024-11-19 05:57:00,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 384 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:00,375 INFO L231 Difference]: Finished difference. Result has 371 places, 382 transitions, 856 flow [2024-11-19 05:57:00,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=371, PETRI_TRANSITIONS=382} [2024-11-19 05:57:00,376 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-19 05:57:00,376 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 382 transitions, 856 flow [2024-11-19 05:57:00,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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:00,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:00,377 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] [2024-11-19 05:57:00,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:57:00,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1959498791, now seen corresponding path program 1 times [2024-11-19 05:57:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147427466] [2024-11-19 05:57:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:00,429 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:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147427466] [2024-11-19 05:57:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147427466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:00,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:00,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751777492] [2024-11-19 05:57:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:00,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:00,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:00,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 382 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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:00,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:00,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:00,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:00,914 INFO L124 PetriNetUnfolderBase]: 260/2958 cut-off events. [2024-11-19 05:57:00,914 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2024-11-19 05:57:00,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2958 events. 260/2958 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27904 event pairs, 42 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 2920. Up to 136 conditions per place. [2024-11-19 05:57:00,973 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2024-11-19 05:57:00,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 900 flow [2024-11-19 05:57:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-19 05:57:00,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-19 05:57:00,977 INFO L175 Difference]: Start difference. First operand has 371 places, 382 transitions, 856 flow. Second operand 3 states and 1242 transitions. [2024-11-19 05:57:00,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 900 flow [2024-11-19 05:57:00,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 386 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:00,983 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 874 flow [2024-11-19 05:57:00,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2024-11-19 05:57:00,984 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-19 05:57:00,984 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 874 flow [2024-11-19 05:57:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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:00,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:00,985 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] [2024-11-19 05:57:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:57:00,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:00,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash -804587533, now seen corresponding path program 1 times [2024-11-19 05:57:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821497086] [2024-11-19 05:57:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:01,021 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:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821497086] [2024-11-19 05:57:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821497086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990849962] [2024-11-19 05:57:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:01,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:01,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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:01,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:01,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,626 INFO L124 PetriNetUnfolderBase]: 390/4199 cut-off events. [2024-11-19 05:57:01,626 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2024-11-19 05:57:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 4199 events. 390/4199 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42591 event pairs, 32 based on Foata normal form. 2/3712 useless extension candidates. Maximal degree in co-relation 3856. Up to 132 conditions per place. [2024-11-19 05:57:01,669 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-19 05:57:01,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 385 transitions, 906 flow [2024-11-19 05:57:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-19 05:57:01,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-19 05:57:01,672 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 874 flow. Second operand 3 states and 1239 transitions. [2024-11-19 05:57:01,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 385 transitions, 906 flow [2024-11-19 05:57:01,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:01,677 INFO L231 Difference]: Finished difference. Result has 372 places, 383 transitions, 870 flow [2024-11-19 05:57:01,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=372, PETRI_TRANSITIONS=383} [2024-11-19 05:57:01,678 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-19 05:57:01,678 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 383 transitions, 870 flow [2024-11-19 05:57:01,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 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:01,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,679 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] [2024-11-19 05:57:01,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:57:01,679 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1314528943, now seen corresponding path program 1 times [2024-11-19 05:57:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:01,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472409197] [2024-11-19 05:57:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:01,703 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:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472409197] [2024-11-19 05:57:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472409197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:01,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:01,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666612520] [2024-11-19 05:57:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:01,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-19 05:57:01,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 383 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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:01,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-19 05:57:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,330 INFO L124 PetriNetUnfolderBase]: 648/5839 cut-off events. [2024-11-19 05:57:02,331 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2024-11-19 05:57:02,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 5839 events. 648/5839 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 64362 event pairs, 68 based on Foata normal form. 1/5262 useless extension candidates. Maximal degree in co-relation 5944. Up to 585 conditions per place. [2024-11-19 05:57:02,392 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 19 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2024-11-19 05:57:02,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 387 transitions, 928 flow [2024-11-19 05:57:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-11-19 05:57:02,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558139534883721 [2024-11-19 05:57:02,396 INFO L175 Difference]: Start difference. First operand has 372 places, 383 transitions, 870 flow. Second operand 3 states and 1233 transitions. [2024-11-19 05:57:02,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 387 transitions, 928 flow [2024-11-19 05:57:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 387 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:02,406 INFO L231 Difference]: Finished difference. Result has 369 places, 383 transitions, 886 flow [2024-11-19 05:57:02,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=369, PETRI_TRANSITIONS=383} [2024-11-19 05:57:02,407 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-19 05:57:02,407 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 383 transitions, 886 flow [2024-11-19 05:57:02,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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:02,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,408 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] [2024-11-19 05:57:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:57:02,408 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1473838492, now seen corresponding path program 1 times [2024-11-19 05:57:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570506287] [2024-11-19 05:57:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,440 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:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570506287] [2024-11-19 05:57:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570506287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:02,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681788932] [2024-11-19 05:57:02,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:02,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 383 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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:02,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:02,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,945 INFO L124 PetriNetUnfolderBase]: 413/3953 cut-off events. [2024-11-19 05:57:02,945 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2024-11-19 05:57:02,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3953 events. 413/3953 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39234 event pairs, 64 based on Foata normal form. 2/3510 useless extension candidates. Maximal degree in co-relation 4191. Up to 287 conditions per place. [2024-11-19 05:57:02,981 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-19 05:57:02,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 387 transitions, 930 flow [2024-11-19 05:57:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-19 05:57:02,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-19 05:57:02,984 INFO L175 Difference]: Start difference. First operand has 369 places, 383 transitions, 886 flow. Second operand 3 states and 1242 transitions. [2024-11-19 05:57:02,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 387 transitions, 930 flow [2024-11-19 05:57:02,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 387 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:02,989 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 908 flow [2024-11-19 05:57:02,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-19 05:57:02,990 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-19 05:57:02,990 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 908 flow [2024-11-19 05:57:02,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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:02,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,992 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] [2024-11-19 05:57:02,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:57:02,992 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash 853128936, now seen corresponding path program 1 times [2024-11-19 05:57:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686171677] [2024-11-19 05:57:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686171677] [2024-11-19 05:57:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686171677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310025140] [2024-11-19 05:57:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:03,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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:03,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:03,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:03,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 474#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-19 05:57:03,431 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-19 05:57:03,431 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-19 05:57:03,431 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-19 05:57:03,431 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-19 05:57:03,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 474#true, 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-19 05:57:03,447 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2024-11-19 05:57:03,447 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-19 05:57:03,447 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-19 05:57:03,447 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2024-11-19 05:57:03,457 INFO L124 PetriNetUnfolderBase]: 392/3250 cut-off events. [2024-11-19 05:57:03,457 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2024-11-19 05:57:03,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 3250 events. 392/3250 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31507 event pairs, 48 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 3700. Up to 248 conditions per place. [2024-11-19 05:57:03,517 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-11-19 05:57:03,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 940 flow [2024-11-19 05:57:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-19 05:57:03,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-19 05:57:03,520 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 908 flow. Second operand 3 states and 1239 transitions. [2024-11-19 05:57:03,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 940 flow [2024-11-19 05:57:03,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 386 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:03,526 INFO L231 Difference]: Finished difference. Result has 372 places, 384 transitions, 904 flow [2024-11-19 05:57:03,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=372, PETRI_TRANSITIONS=384} [2024-11-19 05:57:03,527 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-19 05:57:03,527 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 384 transitions, 904 flow [2024-11-19 05:57:03,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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:03,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:03,528 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:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:57:03,528 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2052204957, now seen corresponding path program 1 times [2024-11-19 05:57:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412282355] [2024-11-19 05:57:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,575 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:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412282355] [2024-11-19 05:57:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412282355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095225999] [2024-11-19 05:57:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 430 [2024-11-19 05:57:03,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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:03,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 430 [2024-11-19 05:57:03,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:04,273 INFO L124 PetriNetUnfolderBase]: 388/4741 cut-off events. [2024-11-19 05:57:04,274 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2024-11-19 05:57:04,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4741 events. 388/4741 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50231 event pairs, 11 based on Foata normal form. 0/4355 useless extension candidates. Maximal degree in co-relation 5160. Up to 210 conditions per place. [2024-11-19 05:57:04,351 INFO L140 encePairwiseOnDemand]: 428/430 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2024-11-19 05:57:04,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 920 flow [2024-11-19 05:57:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2024-11-19 05:57:04,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9635658914728682 [2024-11-19 05:57:04,355 INFO L175 Difference]: Start difference. First operand has 372 places, 384 transitions, 904 flow. Second operand 3 states and 1243 transitions. [2024-11-19 05:57:04,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 920 flow [2024-11-19 05:57:04,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 383 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:04,363 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 900 flow [2024-11-19 05:57:04,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-19 05:57:04,364 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-19 05:57:04,364 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 900 flow [2024-11-19 05:57:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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:04,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:04,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, 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:04,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:57:04,366 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:04,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2069889432, now seen corresponding path program 1 times [2024-11-19 05:57:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:04,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838535050] [2024-11-19 05:57:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:04,413 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:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838535050] [2024-11-19 05:57:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838535050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:04,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427474387] [2024-11-19 05:57:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:04,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:04,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:04,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:04,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:05,194 INFO L124 PetriNetUnfolderBase]: 447/5342 cut-off events. [2024-11-19 05:57:05,195 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2024-11-19 05:57:05,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 5342 events. 447/5342 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 58440 event pairs, 25 based on Foata normal form. 0/4912 useless extension candidates. Maximal degree in co-relation 6230. Up to 193 conditions per place. [2024-11-19 05:57:05,272 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2024-11-19 05:57:05,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 381 transitions, 918 flow [2024-11-19 05:57:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-19 05:57:05,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589147286821705 [2024-11-19 05:57:05,274 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 900 flow. Second operand 3 states and 1237 transitions. [2024-11-19 05:57:05,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 381 transitions, 918 flow [2024-11-19 05:57:05,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 381 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:05,279 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 897 flow [2024-11-19 05:57:05,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-19 05:57:05,280 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-19 05:57:05,280 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 897 flow [2024-11-19 05:57:05,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:05,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:05,281 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] [2024-11-19 05:57:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:57:05,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-19 05:57:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1388669785, now seen corresponding path program 1 times [2024-11-19 05:57:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:05,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129709132] [2024-11-19 05:57:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:05,311 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:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129709132] [2024-11-19 05:57:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129709132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458219007] [2024-11-19 05:57:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:05,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:05,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-19 05:57:05,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:05,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:05,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-19 05:57:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:05,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, 393#L56-53true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-19 05:57:05,673 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-19 05:57:05,673 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-19 05:57:05,673 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-19 05:57:05,673 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-19 05:57:05,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 438#true, Black: 470#true, Black: 474#true, Black: 442#true, 393#L56-53true, 453#(= |#race~sort_label_0~0| 0)]) [2024-11-19 05:57:05,677 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-11-19 05:57:05,677 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-19 05:57:05,677 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-19 05:57:05,677 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-19 05:57:05,684 INFO L124 PetriNetUnfolderBase]: 285/2989 cut-off events. [2024-11-19 05:57:05,684 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2024-11-19 05:57:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2989 events. 285/2989 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27973 event pairs, 33 based on Foata normal form. 5/2739 useless extension candidates. Maximal degree in co-relation 3575. Up to 150 conditions per place. [2024-11-19 05:57:05,726 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2024-11-19 05:57:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 913 flow [2024-11-19 05:57:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2024-11-19 05:57:05,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.958139534883721 [2024-11-19 05:57:05,728 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 897 flow. Second operand 3 states and 1236 transitions. [2024-11-19 05:57:05,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 913 flow [2024-11-19 05:57:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 379 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:05,732 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-11-19 05:57:05,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-11-19 05:57:05,733 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-19 05:57:05,733 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-11-19 05:57:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:05,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2024-11-19 05:57:05,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2024-11-19 05:57:05,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2024-11-19 05:57:05,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2024-11-19 05:57:05,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2024-11-19 05:57:05,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2024-11-19 05:57:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2024-11-19 05:57:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2024-11-19 05:57:05,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2024-11-19 05:57:05,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2024-11-19 05:57:05,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2024-11-19 05:57:05,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2024-11-19 05:57:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:57:05,747 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] [2024-11-19 05:57:05,754 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:05,755 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:05,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:05 BasicIcfg [2024-11-19 05:57:05,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:05,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:05,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:05,760 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:05,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:55" (3/4) ... [2024-11-19 05:57:05,761 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:05,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:05,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:05,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:57:05,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-19 05:57:05,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:05,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:05,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:05,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:05,847 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:05,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:05,847 INFO L158 Benchmark]: Toolchain (without parser) took 11637.43ms. Allocated memory was 195.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 125.6MB in the beginning and 1.1GB in the end (delta: -987.5MB). Peak memory consumption was 184.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,847 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.70ms. Allocated memory is still 195.0MB. Free memory was 125.2MB in the beginning and 111.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.91ms. Allocated memory is still 195.0MB. Free memory was 111.2MB in the beginning and 108.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 195.0MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: RCFGBuilder took 666.70ms. Allocated memory is still 195.0MB. Free memory was 106.7MB in the beginning and 77.0MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: TraceAbstraction took 10514.90ms. Allocated memory was 195.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 765.0MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,848 INFO L158 Benchmark]: Witness Printer took 87.50ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:05,849 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.18ms. Allocated memory is still 117.4MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.70ms. Allocated memory is still 195.0MB. Free memory was 125.2MB in the beginning and 111.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.91ms. Allocated memory is still 195.0MB. Free memory was 111.2MB in the beginning and 108.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 195.0MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 666.70ms. Allocated memory is still 195.0MB. Free memory was 106.7MB in the beginning and 77.0MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10514.90ms. Allocated memory was 195.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 765.0MB. Max. memory is 16.1GB. * Witness Printer took 87.50ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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, 674 locations, 80 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: 10.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 131 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=17, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:05,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE