./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-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-chromosome-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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:32,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:32,436 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:32,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:32,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:32,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:32,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:32,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:32,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:32,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:32,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:32,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:32,482 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:32,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:32,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:32,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:32,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:32,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:32,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:32,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:32,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:32,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:32,489 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:32,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:32,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:32,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:32,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:32,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:32,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:32,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:32,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:32,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:32,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:32,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:32,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:32,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:32,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:32,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:32,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:32,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:32,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:32,496 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2024-11-19 05:56:32,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:32,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:32,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:32,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:32,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:32,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2024-11-19 05:56:34,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:34,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:34,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2024-11-19 05:56:34,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ea60f91/c5acd37d231d47cdb17a82fdaca52219/FLAGd6a75ddc1 [2024-11-19 05:56:34,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ea60f91/c5acd37d231d47cdb17a82fdaca52219 [2024-11-19 05:56:34,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:34,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:34,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:34,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:34,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:34,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:34" (1/1) ... [2024-11-19 05:56:34,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e6c31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:34, skipping insertion in model container [2024-11-19 05:56:34,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:34" (1/1) ... [2024-11-19 05:56:34,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:34,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:34,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:34,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:34,778 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:34,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:34 WrapperNode [2024-11-19 05:56:34,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:34,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:34,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:34,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:34,785 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:34" (1/1) ... [2024-11-19 05:56:34,799 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:34" (1/1) ... [2024-11-19 05:56:34,858 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 446 [2024-11-19 05:56:34,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:34,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:34,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:34,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:34,875 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:34" (1/1) ... [2024-11-19 05:56:34,876 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:34" (1/1) ... [2024-11-19 05:56:34,886 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:34" (1/1) ... [2024-11-19 05:56:34,889 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:34" (1/1) ... [2024-11-19 05:56:34,907 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:34" (1/1) ... [2024-11-19 05:56:34,930 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:34" (1/1) ... [2024-11-19 05:56:34,940 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:34" (1/1) ... [2024-11-19 05:56:34,944 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:34" (1/1) ... [2024-11-19 05:56:34,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:34,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:34,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:34,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:34,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:34" (1/1) ... [2024-11-19 05:56:34,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:34,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:34,999 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:35,001 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:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:56:35,046 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:35,152 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:35,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:35,830 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:35,831 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:35,863 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:35,863 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:56:35,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:35 BoogieIcfgContainer [2024-11-19 05:56:35,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:35,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:35,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:35,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:35,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:34" (1/3) ... [2024-11-19 05:56:35,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b84aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:35, skipping insertion in model container [2024-11-19 05:56:35,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:34" (2/3) ... [2024-11-19 05:56:35,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b84aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:35, skipping insertion in model container [2024-11-19 05:56:35,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:35" (3/3) ... [2024-11-19 05:56:35,875 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2024-11-19 05:56:35,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:35,891 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-11-19 05:56:35,891 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:36,057 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:56:36,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 589 transitions, 1199 flow [2024-11-19 05:56:36,362 INFO L124 PetriNetUnfolderBase]: 33/586 cut-off events. [2024-11-19 05:56:36,363 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:36,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 586 events. 33/586 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1247 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 436. Up to 2 conditions per place. [2024-11-19 05:56:36,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 589 transitions, 1199 flow [2024-11-19 05:56:36,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 566 transitions, 1150 flow [2024-11-19 05:56:36,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:36,417 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;@3836f66b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:36,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-19 05:56:36,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:36,429 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-11-19 05:56:36,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:36,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:36,431 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:36,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:36,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1756171046, now seen corresponding path program 1 times [2024-11-19 05:56:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922588435] [2024-11-19 05:56:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:37,296 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:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922588435] [2024-11-19 05:56:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922588435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:37,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:37,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918043902] [2024-11-19 05:56:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:37,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 589 [2024-11-19 05:56:37,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 566 transitions, 1150 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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:37,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:37,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 589 [2024-11-19 05:56:37,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:41,130 INFO L124 PetriNetUnfolderBase]: 2074/15191 cut-off events. [2024-11-19 05:56:41,131 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2024-11-19 05:56:41,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 15191 events. 2074/15191 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 184180 event pairs, 1520 based on Foata normal form. 1015/13833 useless extension candidates. Maximal degree in co-relation 16163. Up to 2820 conditions per place. [2024-11-19 05:56:41,354 INFO L140 encePairwiseOnDemand]: 549/589 looper letters, 54 selfloop transitions, 15 changer transitions 7/541 dead transitions. [2024-11-19 05:56:41,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 541 transitions, 1238 flow [2024-11-19 05:56:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3052 transitions. [2024-11-19 05:56:41,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8636106395019808 [2024-11-19 05:56:41,390 INFO L175 Difference]: Start difference. First operand has 545 places, 566 transitions, 1150 flow. Second operand 6 states and 3052 transitions. [2024-11-19 05:56:41,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 541 transitions, 1238 flow [2024-11-19 05:56:41,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1226 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:41,417 INFO L231 Difference]: Finished difference. Result has 541 places, 534 transitions, 1104 flow [2024-11-19 05:56:41,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=541, PETRI_TRANSITIONS=534} [2024-11-19 05:56:41,424 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -4 predicate places. [2024-11-19 05:56:41,424 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 534 transitions, 1104 flow [2024-11-19 05:56:41,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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:41,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:41,428 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:41,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:41,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2135015568, now seen corresponding path program 1 times [2024-11-19 05:56:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:41,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088524586] [2024-11-19 05:56:41,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,489 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:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088524586] [2024-11-19 05:56:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088524586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140226897] [2024-11-19 05:56:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:41,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:41,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 534 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:41,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:41,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:41,752 INFO L124 PetriNetUnfolderBase]: 24/956 cut-off events. [2024-11-19 05:56:41,753 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-11-19 05:56:41,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 956 events. 24/956 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3936 event pairs, 7 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 959. Up to 25 conditions per place. [2024-11-19 05:56:41,772 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2024-11-19 05:56:41,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 533 transitions, 1128 flow [2024-11-19 05:56:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:41,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:41,777 INFO L175 Difference]: Start difference. First operand has 541 places, 534 transitions, 1104 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:41,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 533 transitions, 1128 flow [2024-11-19 05:56:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 533 transitions, 1098 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:41,786 INFO L231 Difference]: Finished difference. Result has 530 places, 533 transitions, 1076 flow [2024-11-19 05:56:41,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=530, PETRI_TRANSITIONS=533} [2024-11-19 05:56:41,788 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -15 predicate places. [2024-11-19 05:56:41,788 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 533 transitions, 1076 flow [2024-11-19 05:56:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:41,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:41,790 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:41,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:41,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1256574315, now seen corresponding path program 1 times [2024-11-19 05:56:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320677075] [2024-11-19 05:56:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,854 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:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320677075] [2024-11-19 05:56:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320677075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577136329] [2024-11-19 05:56:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:41,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:41,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 533 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:41,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,006 INFO L124 PetriNetUnfolderBase]: 18/748 cut-off events. [2024-11-19 05:56:42,006 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:56:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 748 events. 18/748 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2600 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 708. Up to 22 conditions per place. [2024-11-19 05:56:42,019 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2024-11-19 05:56:42,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 532 transitions, 1100 flow [2024-11-19 05:56:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:42,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:42,024 INFO L175 Difference]: Start difference. First operand has 530 places, 533 transitions, 1076 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:42,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 532 transitions, 1100 flow [2024-11-19 05:56:42,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 532 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:42,033 INFO L231 Difference]: Finished difference. Result has 529 places, 532 transitions, 1074 flow [2024-11-19 05:56:42,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=529, PETRI_TRANSITIONS=532} [2024-11-19 05:56:42,036 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -16 predicate places. [2024-11-19 05:56:42,036 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 532 transitions, 1074 flow [2024-11-19 05:56:42,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,038 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] [2024-11-19 05:56:42,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:42,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1445982715, now seen corresponding path program 1 times [2024-11-19 05:56:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145342460] [2024-11-19 05:56:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,108 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:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145342460] [2024-11-19 05:56:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145342460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:42,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:42,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493636760] [2024-11-19 05:56:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:42,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:42,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,263 INFO L124 PetriNetUnfolderBase]: 18/645 cut-off events. [2024-11-19 05:56:42,263 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-19 05:56:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 645 events. 18/645 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1998 event pairs, 7 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 560. Up to 25 conditions per place. [2024-11-19 05:56:42,279 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2024-11-19 05:56:42,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1098 flow [2024-11-19 05:56:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:42,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:42,284 INFO L175 Difference]: Start difference. First operand has 529 places, 532 transitions, 1074 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:42,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1098 flow [2024-11-19 05:56:42,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 531 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:42,294 INFO L231 Difference]: Finished difference. Result has 528 places, 531 transitions, 1072 flow [2024-11-19 05:56:42,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2024-11-19 05:56:42,297 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -17 predicate places. [2024-11-19 05:56:42,297 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1072 flow [2024-11-19 05:56:42,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:42,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:42,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:42,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -464666885, now seen corresponding path program 1 times [2024-11-19 05:56:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177769619] [2024-11-19 05:56:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,393 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:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177769619] [2024-11-19 05:56:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177769619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472199347] [2024-11-19 05:56:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:42,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:42,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:42,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:42,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:42,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:42,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,647 INFO L124 PetriNetUnfolderBase]: 28/1131 cut-off events. [2024-11-19 05:56:42,647 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:42,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 1131 events. 28/1131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5491 event pairs, 7 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1002. Up to 25 conditions per place. [2024-11-19 05:56:42,664 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-19 05:56:42,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 530 transitions, 1096 flow [2024-11-19 05:56:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:42,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:42,669 INFO L175 Difference]: Start difference. First operand has 528 places, 531 transitions, 1072 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:42,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 530 transitions, 1096 flow [2024-11-19 05:56:42,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 530 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:42,677 INFO L231 Difference]: Finished difference. Result has 527 places, 530 transitions, 1070 flow [2024-11-19 05:56:42,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=527, PETRI_TRANSITIONS=530} [2024-11-19 05:56:42,680 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2024-11-19 05:56:42,680 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 530 transitions, 1070 flow [2024-11-19 05:56:42,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,682 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] [2024-11-19 05:56:42,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:42,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1972077386, now seen corresponding path program 1 times [2024-11-19 05:56:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923928575] [2024-11-19 05:56:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,732 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:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923928575] [2024-11-19 05:56:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923928575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650059031] [2024-11-19 05:56:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:42,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:42,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 530 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:42,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:42,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,892 INFO L124 PetriNetUnfolderBase]: 22/941 cut-off events. [2024-11-19 05:56:42,893 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-11-19 05:56:42,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 941 events. 22/941 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3551 event pairs, 5 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2024-11-19 05:56:42,909 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-19 05:56:42,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 529 transitions, 1094 flow [2024-11-19 05:56:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:42,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:42,913 INFO L175 Difference]: Start difference. First operand has 527 places, 530 transitions, 1070 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:42,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 529 transitions, 1094 flow [2024-11-19 05:56:42,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:42,921 INFO L231 Difference]: Finished difference. Result has 526 places, 529 transitions, 1068 flow [2024-11-19 05:56:42,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=526, PETRI_TRANSITIONS=529} [2024-11-19 05:56:42,923 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-19 05:56:42,923 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 529 transitions, 1068 flow [2024-11-19 05:56:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:42,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:42,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash -761241225, now seen corresponding path program 1 times [2024-11-19 05:56:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13937144] [2024-11-19 05:56:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,976 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:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13937144] [2024-11-19 05:56:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13937144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955216350] [2024-11-19 05:56:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:42,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 589 [2024-11-19 05:56:42,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 529 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:42,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:42,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 589 [2024-11-19 05:56:42,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,122 INFO L124 PetriNetUnfolderBase]: 24/906 cut-off events. [2024-11-19 05:56:43,122 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-19 05:56:43,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 906 events. 24/906 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3249 event pairs, 7 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 758. Up to 25 conditions per place. [2024-11-19 05:56:43,136 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2024-11-19 05:56:43,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1092 flow [2024-11-19 05:56:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:43,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:43,140 INFO L175 Difference]: Start difference. First operand has 526 places, 529 transitions, 1068 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:43,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1092 flow [2024-11-19 05:56:43,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 528 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:43,148 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1066 flow [2024-11-19 05:56:43,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2024-11-19 05:56:43,149 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-19 05:56:43,150 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1066 flow [2024-11-19 05:56:43,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:43,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,151 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] [2024-11-19 05:56:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:43,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:43,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1859492096, now seen corresponding path program 1 times [2024-11-19 05:56:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820726495] [2024-11-19 05:56:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,201 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:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820726495] [2024-11-19 05:56:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820726495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224508571] [2024-11-19 05:56:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:56:43,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:43,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:56:43,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,447 INFO L124 PetriNetUnfolderBase]: 45/1330 cut-off events. [2024-11-19 05:56:43,448 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1330 events. 45/1330 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7336 event pairs, 6 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 1204. Up to 43 conditions per place. [2024-11-19 05:56:43,473 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-19 05:56:43,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 530 transitions, 1102 flow [2024-11-19 05:56:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-19 05:56:43,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-19 05:56:43,479 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1066 flow. Second operand 3 states and 1673 transitions. [2024-11-19 05:56:43,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 530 transitions, 1102 flow [2024-11-19 05:56:43,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 530 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:43,491 INFO L231 Difference]: Finished difference. Result has 524 places, 528 transitions, 1072 flow [2024-11-19 05:56:43,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=524, PETRI_TRANSITIONS=528} [2024-11-19 05:56:43,493 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -21 predicate places. [2024-11-19 05:56:43,493 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 528 transitions, 1072 flow [2024-11-19 05:56:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:43,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,494 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] [2024-11-19 05:56:43,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:43,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -731927162, now seen corresponding path program 1 times [2024-11-19 05:56:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039824850] [2024-11-19 05:56:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,556 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:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039824850] [2024-11-19 05:56:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039824850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286831036] [2024-11-19 05:56:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:56:43,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 528 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:43,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:56:43,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,815 INFO L124 PetriNetUnfolderBase]: 36/1203 cut-off events. [2024-11-19 05:56:43,815 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:56:43,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1203 events. 36/1203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5729 event pairs, 6 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 953. Up to 31 conditions per place. [2024-11-19 05:56:43,841 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-19 05:56:43,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1108 flow [2024-11-19 05:56:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-19 05:56:43,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-19 05:56:43,846 INFO L175 Difference]: Start difference. First operand has 524 places, 528 transitions, 1072 flow. Second operand 3 states and 1673 transitions. [2024-11-19 05:56:43,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1108 flow [2024-11-19 05:56:43,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 530 transitions, 1108 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:43,856 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1082 flow [2024-11-19 05:56:43,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2024-11-19 05:56:43,857 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-19 05:56:43,857 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1082 flow [2024-11-19 05:56:43,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:43,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:43,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:43,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2007253713, now seen corresponding path program 1 times [2024-11-19 05:56:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120332836] [2024-11-19 05:56:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,918 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:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120332836] [2024-11-19 05:56:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120332836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924297446] [2024-11-19 05:56:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-19 05:56:43,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:43,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-19 05:56:43,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:44,162 INFO L124 PetriNetUnfolderBase]: 39/1108 cut-off events. [2024-11-19 05:56:44,163 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2024-11-19 05:56:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1108 events. 39/1108 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5604 event pairs, 12 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 891. Up to 38 conditions per place. [2024-11-19 05:56:44,189 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 15 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-19 05:56:44,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2024-11-19 05:56:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2024-11-19 05:56:44,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422750424448217 [2024-11-19 05:56:44,193 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1082 flow. Second operand 3 states and 1665 transitions. [2024-11-19 05:56:44,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2024-11-19 05:56:44,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:44,202 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1084 flow [2024-11-19 05:56:44,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2024-11-19 05:56:44,206 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-19 05:56:44,207 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1084 flow [2024-11-19 05:56:44,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:44,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:44,208 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] [2024-11-19 05:56:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:44,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1969250575, now seen corresponding path program 1 times [2024-11-19 05:56:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168558980] [2024-11-19 05:56:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:44,265 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:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168558980] [2024-11-19 05:56:44,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168558980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:44,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:44,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395240619] [2024-11-19 05:56:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:44,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:56:44,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:44,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:44,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:56:44,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:44,610 INFO L124 PetriNetUnfolderBase]: 77/2149 cut-off events. [2024-11-19 05:56:44,612 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-19 05:56:44,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 2149 events. 77/2149 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15002 event pairs, 16 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 1651. Up to 66 conditions per place. [2024-11-19 05:56:44,649 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-19 05:56:44,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2024-11-19 05:56:44,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-19 05:56:44,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-19 05:56:44,653 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1084 flow. Second operand 3 states and 1673 transitions. [2024-11-19 05:56:44,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2024-11-19 05:56:44,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 529 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:44,663 INFO L231 Difference]: Finished difference. Result has 525 places, 527 transitions, 1090 flow [2024-11-19 05:56:44,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=525, PETRI_TRANSITIONS=527} [2024-11-19 05:56:44,664 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2024-11-19 05:56:44,664 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 527 transitions, 1090 flow [2024-11-19 05:56:44,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:44,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:44,666 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] [2024-11-19 05:56:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:44,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:44,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 21472046, now seen corresponding path program 1 times [2024-11-19 05:56:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169822587] [2024-11-19 05:56:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:44,719 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:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169822587] [2024-11-19 05:56:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169822587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835439286] [2024-11-19 05:56:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:44,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:56:44,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 527 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:44,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:44,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:56:44,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,059 INFO L124 PetriNetUnfolderBase]: 77/1945 cut-off events. [2024-11-19 05:56:45,059 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-11-19 05:56:45,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1945 events. 77/1945 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12822 event pairs, 4 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 1564. Up to 69 conditions per place. [2024-11-19 05:56:45,099 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2024-11-19 05:56:45,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 532 transitions, 1141 flow [2024-11-19 05:56:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2024-11-19 05:56:45,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2024-11-19 05:56:45,103 INFO L175 Difference]: Start difference. First operand has 525 places, 527 transitions, 1090 flow. Second operand 3 states and 1676 transitions. [2024-11-19 05:56:45,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 532 transitions, 1141 flow [2024-11-19 05:56:45,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 532 transitions, 1141 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:45,112 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1100 flow [2024-11-19 05:56:45,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2024-11-19 05:56:45,115 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-19 05:56:45,115 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1100 flow [2024-11-19 05:56:45,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:45,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:45,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 665665593, now seen corresponding path program 1 times [2024-11-19 05:56:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072219284] [2024-11-19 05:56:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,168 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:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072219284] [2024-11-19 05:56:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072219284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142956345] [2024-11-19 05:56:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:45,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:45,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:45,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 589 [2024-11-19 05:56:45,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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:45,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:45,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 589 [2024-11-19 05:56:45,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,770 INFO L124 PetriNetUnfolderBase]: 90/2599 cut-off events. [2024-11-19 05:56:45,770 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-19 05:56:45,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 2599 events. 90/2599 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17764 event pairs, 10 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 2373. Up to 40 conditions per place. [2024-11-19 05:56:45,817 INFO L140 encePairwiseOnDemand]: 581/589 looper letters, 15 selfloop transitions, 5 changer transitions 0/529 dead transitions. [2024-11-19 05:56:45,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 529 transitions, 1146 flow [2024-11-19 05:56:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2024-11-19 05:56:45,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9417091114883984 [2024-11-19 05:56:45,822 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1100 flow. Second operand 3 states and 1664 transitions. [2024-11-19 05:56:45,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 529 transitions, 1146 flow [2024-11-19 05:56:45,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 529 transitions, 1146 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:45,831 INFO L231 Difference]: Finished difference. Result has 527 places, 527 transitions, 1126 flow [2024-11-19 05:56:45,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=527, PETRI_TRANSITIONS=527} [2024-11-19 05:56:45,833 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2024-11-19 05:56:45,833 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 527 transitions, 1126 flow [2024-11-19 05:56:45,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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:45,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:56:45,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -852237650, now seen corresponding path program 1 times [2024-11-19 05:56:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099963002] [2024-11-19 05:56:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,891 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:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099963002] [2024-11-19 05:56:45,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099963002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:45,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702127635] [2024-11-19 05:56:45,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:45,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:56:45,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 527 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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:45,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:45,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:56:45,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:46,450 INFO L124 PetriNetUnfolderBase]: 104/2074 cut-off events. [2024-11-19 05:56:46,450 INFO L125 PetriNetUnfolderBase]: For 31/63 co-relation queries the response was YES. [2024-11-19 05:56:46,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 2074 events. 104/2074 cut-off events. For 31/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13927 event pairs, 36 based on Foata normal form. 1/1806 useless extension candidates. Maximal degree in co-relation 1940. Up to 112 conditions per place. [2024-11-19 05:56:46,506 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2024-11-19 05:56:46,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 528 transitions, 1166 flow [2024-11-19 05:56:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-19 05:56:46,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-19 05:56:46,510 INFO L175 Difference]: Start difference. First operand has 527 places, 527 transitions, 1126 flow. Second operand 3 states and 1663 transitions. [2024-11-19 05:56:46,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 528 transitions, 1166 flow [2024-11-19 05:56:46,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 528 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:46,521 INFO L231 Difference]: Finished difference. Result has 526 places, 526 transitions, 1118 flow [2024-11-19 05:56:46,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=526, PETRI_TRANSITIONS=526} [2024-11-19 05:56:46,522 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2024-11-19 05:56:46,522 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 526 transitions, 1118 flow [2024-11-19 05:56:46,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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:46,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:46,524 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] [2024-11-19 05:56:46,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:56:46,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:46,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1010636245, now seen corresponding path program 1 times [2024-11-19 05:56:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375590198] [2024-11-19 05:56:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:46,654 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:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375590198] [2024-11-19 05:56:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375590198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:56:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999557711] [2024-11-19 05:56:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:56:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:56:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:56:46,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-19 05:56:46,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 526 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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:46,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:46,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-19 05:56:46,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:47,517 INFO L124 PetriNetUnfolderBase]: 99/3208 cut-off events. [2024-11-19 05:56:47,517 INFO L125 PetriNetUnfolderBase]: For 9/43 co-relation queries the response was YES. [2024-11-19 05:56:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 3208 events. 99/3208 cut-off events. For 9/43 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22079 event pairs, 15 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 3059. Up to 50 conditions per place. [2024-11-19 05:56:47,575 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 27 selfloop transitions, 4 changer transitions 0/542 dead transitions. [2024-11-19 05:56:47,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 542 transitions, 1222 flow [2024-11-19 05:56:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:56:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:56:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2787 transitions. [2024-11-19 05:56:47,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9463497453310696 [2024-11-19 05:56:47,583 INFO L175 Difference]: Start difference. First operand has 526 places, 526 transitions, 1118 flow. Second operand 5 states and 2787 transitions. [2024-11-19 05:56:47,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 542 transitions, 1222 flow [2024-11-19 05:56:47,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 542 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:47,597 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1139 flow [2024-11-19 05:56:47,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2024-11-19 05:56:47,599 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -14 predicate places. [2024-11-19 05:56:47,599 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1139 flow [2024-11-19 05:56:47,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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:47,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:47,602 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] [2024-11-19 05:56:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:56:47,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2101153416, now seen corresponding path program 1 times [2024-11-19 05:56:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956439632] [2024-11-19 05:56:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:47,743 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:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:47,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956439632] [2024-11-19 05:56:47,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956439632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:47,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347043575] [2024-11-19 05:56:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:47,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-19 05:56:47,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:47,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:47,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-19 05:56:47,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:48,429 INFO L124 PetriNetUnfolderBase]: 142/4425 cut-off events. [2024-11-19 05:56:48,429 INFO L125 PetriNetUnfolderBase]: For 43/90 co-relation queries the response was YES. [2024-11-19 05:56:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 4425 events. 142/4425 cut-off events. For 43/90 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35259 event pairs, 28 based on Foata normal form. 7/3863 useless extension candidates. Maximal degree in co-relation 4377. Up to 95 conditions per place. [2024-11-19 05:56:48,498 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 17 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2024-11-19 05:56:48,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 529 transitions, 1181 flow [2024-11-19 05:56:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2024-11-19 05:56:48,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422750424448217 [2024-11-19 05:56:48,502 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1139 flow. Second operand 3 states and 1665 transitions. [2024-11-19 05:56:48,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 529 transitions, 1181 flow [2024-11-19 05:56:48,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 529 transitions, 1181 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:48,512 INFO L231 Difference]: Finished difference. Result has 532 places, 527 transitions, 1141 flow [2024-11-19 05:56:48,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=532, PETRI_TRANSITIONS=527} [2024-11-19 05:56:48,513 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -13 predicate places. [2024-11-19 05:56:48,513 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 527 transitions, 1141 flow [2024-11-19 05:56:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:48,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:48,514 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] [2024-11-19 05:56:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:56:48,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1312894679, now seen corresponding path program 1 times [2024-11-19 05:56:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544237215] [2024-11-19 05:56:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:48,625 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:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544237215] [2024-11-19 05:56:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544237215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840950454] [2024-11-19 05:56:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:48,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:56:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:56:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:56:48,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 589 [2024-11-19 05:56:48,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 527 transitions, 1141 flow. Second operand has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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:48,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:48,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 589 [2024-11-19 05:56:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:49,084 INFO L124 PetriNetUnfolderBase]: 33/1365 cut-off events. [2024-11-19 05:56:49,084 INFO L125 PetriNetUnfolderBase]: For 11/25 co-relation queries the response was YES. [2024-11-19 05:56:49,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 1365 events. 33/1365 cut-off events. For 11/25 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6531 event pairs, 1 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 1368. Up to 20 conditions per place. [2024-11-19 05:56:49,109 INFO L140 encePairwiseOnDemand]: 568/589 looper letters, 18 selfloop transitions, 18 changer transitions 0/530 dead transitions. [2024-11-19 05:56:49,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 530 transitions, 1219 flow [2024-11-19 05:56:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:56:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:56:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2699 transitions. [2024-11-19 05:56:49,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164685908319186 [2024-11-19 05:56:49,114 INFO L175 Difference]: Start difference. First operand has 532 places, 527 transitions, 1141 flow. Second operand 5 states and 2699 transitions. [2024-11-19 05:56:49,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 530 transitions, 1219 flow [2024-11-19 05:56:49,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 530 transitions, 1215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:49,123 INFO L231 Difference]: Finished difference. Result has 535 places, 530 transitions, 1197 flow [2024-11-19 05:56:49,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1197, PETRI_PLACES=535, PETRI_TRANSITIONS=530} [2024-11-19 05:56:49,124 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2024-11-19 05:56:49,124 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 530 transitions, 1197 flow [2024-11-19 05:56:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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:49,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:49,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:49,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:56:49,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 386569357, now seen corresponding path program 1 times [2024-11-19 05:56:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995749993] [2024-11-19 05:56:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995749993] [2024-11-19 05:56:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995749993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:56:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024693177] [2024-11-19 05:56:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:56:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:49,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:56:49,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:56:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:49,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 05:56:49,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:56:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:49,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:56:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024693177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:56:49,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:56:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-19 05:56:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454351329] [2024-11-19 05:56:49,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:56:49,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 05:56:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 05:56:49,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-19 05:56:50,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 589 [2024-11-19 05:56:50,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 530 transitions, 1197 flow. Second operand has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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:50,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:50,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 589 [2024-11-19 05:56:50,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:50,875 INFO L124 PetriNetUnfolderBase]: 33/1416 cut-off events. [2024-11-19 05:56:50,875 INFO L125 PetriNetUnfolderBase]: For 23/37 co-relation queries the response was YES. [2024-11-19 05:56:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1416 events. 33/1416 cut-off events. For 23/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6420 event pairs, 1 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1480. Up to 20 conditions per place. [2024-11-19 05:56:50,901 INFO L140 encePairwiseOnDemand]: 559/589 looper letters, 30 selfloop transitions, 39 changer transitions 0/554 dead transitions. [2024-11-19 05:56:50,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 554 transitions, 1389 flow [2024-11-19 05:56:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5828 transitions. [2024-11-19 05:56:50,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995215311004785 [2024-11-19 05:56:50,911 INFO L175 Difference]: Start difference. First operand has 535 places, 530 transitions, 1197 flow. Second operand 11 states and 5828 transitions. [2024-11-19 05:56:50,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 554 transitions, 1389 flow [2024-11-19 05:56:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 554 transitions, 1359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 05:56:50,925 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1347 flow [2024-11-19 05:56:50,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2024-11-19 05:56:50,926 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2024-11-19 05:56:50,927 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1347 flow [2024-11-19 05:56:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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:50,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:50,929 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 05:56:51,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 05:56:51,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:51,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 58646157, now seen corresponding path program 2 times [2024-11-19 05:56:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612411094] [2024-11-19 05:56:51,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:56:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:51,179 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:56:51,179 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:56:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612411094] [2024-11-19 05:56:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612411094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049667472] [2024-11-19 05:56:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:51,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:51,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:52,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:56:52,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:52,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:52,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:56:52,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:52,609 INFO L124 PetriNetUnfolderBase]: 77/2316 cut-off events. [2024-11-19 05:56:52,609 INFO L125 PetriNetUnfolderBase]: For 50/92 co-relation queries the response was YES. [2024-11-19 05:56:52,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2316 events. 77/2316 cut-off events. For 50/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14073 event pairs, 5 based on Foata normal form. 8/2072 useless extension candidates. Maximal degree in co-relation 2564. Up to 70 conditions per place. [2024-11-19 05:56:52,633 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 30 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2024-11-19 05:56:52,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 555 transitions, 1441 flow [2024-11-19 05:56:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2024-11-19 05:56:52,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219015280135824 [2024-11-19 05:56:52,637 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1347 flow. Second operand 6 states and 3258 transitions. [2024-11-19 05:56:52,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 555 transitions, 1441 flow [2024-11-19 05:56:52,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1405 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 05:56:52,650 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1321 flow [2024-11-19 05:56:52,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1321, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-19 05:56:52,652 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2024-11-19 05:56:52,652 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1321 flow [2024-11-19 05:56:52,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:52,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:52,654 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:56:52,655 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 465710012, now seen corresponding path program 1 times [2024-11-19 05:56:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554754043] [2024-11-19 05:56:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554754043] [2024-11-19 05:56:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554754043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:52,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467111933] [2024-11-19 05:56:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:52,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:56:52,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:52,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:52,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:56:52,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:53,202 INFO L124 PetriNetUnfolderBase]: 145/2185 cut-off events. [2024-11-19 05:56:53,203 INFO L125 PetriNetUnfolderBase]: For 121/165 co-relation queries the response was YES. [2024-11-19 05:56:53,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2185 events. 145/2185 cut-off events. For 121/165 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14531 event pairs, 61 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 2262. Up to 187 conditions per place. [2024-11-19 05:56:53,239 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2024-11-19 05:56:53,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1361 flow [2024-11-19 05:56:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-19 05:56:53,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-19 05:56:53,242 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1321 flow. Second operand 3 states and 1663 transitions. [2024-11-19 05:56:53,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1361 flow [2024-11-19 05:56:53,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1349 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:53,251 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1311 flow [2024-11-19 05:56:53,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2024-11-19 05:56:53,252 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2024-11-19 05:56:53,252 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1311 flow [2024-11-19 05:56:53,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:53,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:53,253 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:56:53,254 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 694514784, now seen corresponding path program 1 times [2024-11-19 05:56:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:53,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087246627] [2024-11-19 05:56:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087246627] [2024-11-19 05:56:53,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087246627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:53,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782218566] [2024-11-19 05:56:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:53,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:53,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 589 [2024-11-19 05:56:53,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:53,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:53,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 589 [2024-11-19 05:56:53,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:54,144 INFO L124 PetriNetUnfolderBase]: 154/3695 cut-off events. [2024-11-19 05:56:54,144 INFO L125 PetriNetUnfolderBase]: For 47/115 co-relation queries the response was YES. [2024-11-19 05:56:54,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 3695 events. 154/3695 cut-off events. For 47/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 27416 event pairs, 25 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 3851. Up to 110 conditions per place. [2024-11-19 05:56:54,207 INFO L140 encePairwiseOnDemand]: 580/589 looper letters, 17 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2024-11-19 05:56:54,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1359 flow [2024-11-19 05:56:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2024-11-19 05:56:54,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9383135257498585 [2024-11-19 05:56:54,209 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1311 flow. Second operand 3 states and 1658 transitions. [2024-11-19 05:56:54,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1359 flow [2024-11-19 05:56:54,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:54,218 INFO L231 Difference]: Finished difference. Result has 540 places, 545 transitions, 1331 flow [2024-11-19 05:56:54,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=540, PETRI_TRANSITIONS=545} [2024-11-19 05:56:54,219 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2024-11-19 05:56:54,220 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 545 transitions, 1331 flow [2024-11-19 05:56:54,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:54,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:54,221 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:56:54,221 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 524426800, now seen corresponding path program 1 times [2024-11-19 05:56:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401489823] [2024-11-19 05:56:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401489823] [2024-11-19 05:56:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401489823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386013393] [2024-11-19 05:56:54,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:54,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:54,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:56:54,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:54,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:54,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:56:54,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:55,093 INFO L124 PetriNetUnfolderBase]: 136/3757 cut-off events. [2024-11-19 05:56:55,094 INFO L125 PetriNetUnfolderBase]: For 76/112 co-relation queries the response was YES. [2024-11-19 05:56:55,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3757 events. 136/3757 cut-off events. For 76/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 28116 event pairs, 30 based on Foata normal form. 1/3336 useless extension candidates. Maximal degree in co-relation 3883. Up to 141 conditions per place. [2024-11-19 05:56:55,174 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 16 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-19 05:56:55,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 550 transitions, 1382 flow [2024-11-19 05:56:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2024-11-19 05:56:55,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2024-11-19 05:56:55,177 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1331 flow. Second operand 3 states and 1676 transitions. [2024-11-19 05:56:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 550 transitions, 1382 flow [2024-11-19 05:56:55,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 550 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:55,187 INFO L231 Difference]: Finished difference. Result has 539 places, 545 transitions, 1331 flow [2024-11-19 05:56:55,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=539, PETRI_TRANSITIONS=545} [2024-11-19 05:56:55,188 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-19 05:56:55,188 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 545 transitions, 1331 flow [2024-11-19 05:56:55,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:55,189 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:56:55,189 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1463529398, now seen corresponding path program 1 times [2024-11-19 05:56:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945675259] [2024-11-19 05:56:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945675259] [2024-11-19 05:56:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945675259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:56:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913477398] [2024-11-19 05:56:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:55,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:56:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:56:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:56:55,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-19 05:56:55,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 545 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:55,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-19 05:56:55,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:56,760 INFO L124 PetriNetUnfolderBase]: 244/6510 cut-off events. [2024-11-19 05:56:56,761 INFO L125 PetriNetUnfolderBase]: For 89/254 co-relation queries the response was YES. [2024-11-19 05:56:56,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6510 events. 244/6510 cut-off events. For 89/254 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56752 event pairs, 58 based on Foata normal form. 6/5735 useless extension candidates. Maximal degree in co-relation 6989. Up to 155 conditions per place. [2024-11-19 05:56:56,880 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 25 selfloop transitions, 4 changer transitions 0/559 dead transitions. [2024-11-19 05:56:56,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 559 transitions, 1425 flow [2024-11-19 05:56:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:56:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:56:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2024-11-19 05:56:56,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456706281833617 [2024-11-19 05:56:56,884 INFO L175 Difference]: Start difference. First operand has 539 places, 545 transitions, 1331 flow. Second operand 5 states and 2785 transitions. [2024-11-19 05:56:56,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 559 transitions, 1425 flow [2024-11-19 05:56:56,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 559 transitions, 1425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:56,895 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1356 flow [2024-11-19 05:56:56,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1356, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-19 05:56:56,896 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2024-11-19 05:56:56,896 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1356 flow [2024-11-19 05:56:56,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:56,897 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:56:56,898 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -662526951, now seen corresponding path program 1 times [2024-11-19 05:56:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114282324] [2024-11-19 05:56:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 05:56:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114282324] [2024-11-19 05:56:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114282324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079605107] [2024-11-19 05:56:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:57,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:56:57,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1356 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:57,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:56:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:58,893 INFO L124 PetriNetUnfolderBase]: 386/9202 cut-off events. [2024-11-19 05:56:58,893 INFO L125 PetriNetUnfolderBase]: For 237/455 co-relation queries the response was YES. [2024-11-19 05:56:58,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 9202 events. 386/9202 cut-off events. For 237/455 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 91831 event pairs, 113 based on Foata normal form. 6/8092 useless extension candidates. Maximal degree in co-relation 10088. Up to 310 conditions per place. [2024-11-19 05:56:59,008 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 18 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2024-11-19 05:56:59,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1400 flow [2024-11-19 05:56:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-19 05:56:59,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-19 05:56:59,010 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1356 flow. Second operand 3 states and 1663 transitions. [2024-11-19 05:56:59,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1400 flow [2024-11-19 05:56:59,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 548 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:59,018 INFO L231 Difference]: Finished difference. Result has 547 places, 546 transitions, 1358 flow [2024-11-19 05:56:59,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=547, PETRI_TRANSITIONS=546} [2024-11-19 05:56:59,019 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 2 predicate places. [2024-11-19 05:56:59,019 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 546 transitions, 1358 flow [2024-11-19 05:56:59,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:59,020 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:56:59,020 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:56:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1543446152, now seen corresponding path program 1 times [2024-11-19 05:56:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986812632] [2024-11-19 05:56:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 05:56:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:59,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986812632] [2024-11-19 05:56:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986812632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:56:59,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596117285] [2024-11-19 05:56:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:59,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:56:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:59,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:56:59,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:56:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:59,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 05:56:59,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:56:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 05:56:59,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:57:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 05:57:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596117285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:57:00,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:57:00,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-11-19 05:57:00,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533738002] [2024-11-19 05:57:00,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:57:00,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 05:57:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:00,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 05:57:00,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-19 05:57:00,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 589 [2024-11-19 05:57:00,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 546 transitions, 1358 flow. Second operand has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:00,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 589 [2024-11-19 05:57:00,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,754 INFO L124 PetriNetUnfolderBase]: 50/2302 cut-off events. [2024-11-19 05:57:01,754 INFO L125 PetriNetUnfolderBase]: For 84/116 co-relation queries the response was YES. [2024-11-19 05:57:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 2302 events. 50/2302 cut-off events. For 84/116 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13177 event pairs, 4 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 2482. Up to 37 conditions per place. [2024-11-19 05:57:01,809 INFO L140 encePairwiseOnDemand]: 559/589 looper letters, 36 selfloop transitions, 57 changer transitions 0/576 dead transitions. [2024-11-19 05:57:01,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 576 transitions, 1688 flow [2024-11-19 05:57:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 05:57:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-19 05:57:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8990 transitions. [2024-11-19 05:57:01,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8978328173374613 [2024-11-19 05:57:01,818 INFO L175 Difference]: Start difference. First operand has 547 places, 546 transitions, 1358 flow. Second operand 17 states and 8990 transitions. [2024-11-19 05:57:01,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 576 transitions, 1688 flow [2024-11-19 05:57:01,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 576 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:01,831 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1630 flow [2024-11-19 05:57:01,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1630, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2024-11-19 05:57:01,833 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 19 predicate places. [2024-11-19 05:57:01,833 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1630 flow [2024-11-19 05:57:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,837 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 05:57:02,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 05:57:02,042 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 577215352, now seen corresponding path program 2 times [2024-11-19 05:57:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127625094] [2024-11-19 05:57:02,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:57:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:57:02,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:57:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127625094] [2024-11-19 05:57:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127625094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861804447] [2024-11-19 05:57:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:02,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:57:02,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1630 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:57:02,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:04,540 INFO L124 PetriNetUnfolderBase]: 200/4564 cut-off events. [2024-11-19 05:57:04,540 INFO L125 PetriNetUnfolderBase]: For 219/444 co-relation queries the response was YES. [2024-11-19 05:57:04,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 4564 events. 200/4564 cut-off events. For 219/444 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 35006 event pairs, 18 based on Foata normal form. 17/4114 useless extension candidates. Maximal degree in co-relation 5209. Up to 147 conditions per place. [2024-11-19 05:57:04,649 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 30 selfloop transitions, 6 changer transitions 0/574 dead transitions. [2024-11-19 05:57:04,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1724 flow [2024-11-19 05:57:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2024-11-19 05:57:04,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219015280135824 [2024-11-19 05:57:04,655 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1630 flow. Second operand 6 states and 3258 transitions. [2024-11-19 05:57:04,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1724 flow [2024-11-19 05:57:04,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 574 transitions, 1646 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-19 05:57:04,671 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1562 flow [2024-11-19 05:57:04,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2024-11-19 05:57:04,672 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 15 predicate places. [2024-11-19 05:57:04,673 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1562 flow [2024-11-19 05:57:04,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:04,674 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:57:04,675 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1951064292, now seen corresponding path program 1 times [2024-11-19 05:57:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057949552] [2024-11-19 05:57:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057949552] [2024-11-19 05:57:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057949552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656563846] [2024-11-19 05:57:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:04,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:04,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 589 [2024-11-19 05:57:04,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 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,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:04,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 589 [2024-11-19 05:57:04,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:06,364 INFO L124 PetriNetUnfolderBase]: 235/4728 cut-off events. [2024-11-19 05:57:06,364 INFO L125 PetriNetUnfolderBase]: For 255/339 co-relation queries the response was YES. [2024-11-19 05:57:06,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 4728 events. 235/4728 cut-off events. For 255/339 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 38989 event pairs, 56 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 5108. Up to 240 conditions per place. [2024-11-19 05:57:06,467 INFO L140 encePairwiseOnDemand]: 580/589 looper letters, 13 selfloop transitions, 4 changer transitions 18/567 dead transitions. [2024-11-19 05:57:06,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 567 transitions, 1608 flow [2024-11-19 05:57:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2024-11-19 05:57:06,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377475947934352 [2024-11-19 05:57:06,470 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1562 flow. Second operand 3 states and 1657 transitions. [2024-11-19 05:57:06,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 567 transitions, 1608 flow [2024-11-19 05:57:06,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 567 transitions, 1596 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:06,480 INFO L231 Difference]: Finished difference. Result has 555 places, 547 transitions, 1529 flow [2024-11-19 05:57:06,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=555, PETRI_TRANSITIONS=547} [2024-11-19 05:57:06,481 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 10 predicate places. [2024-11-19 05:57:06,481 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 547 transitions, 1529 flow [2024-11-19 05:57:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:06,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:06,482 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:57:06,483 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 926838452, now seen corresponding path program 1 times [2024-11-19 05:57:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373866930] [2024-11-19 05:57:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373866930] [2024-11-19 05:57:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373866930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:07,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:07,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337980180] [2024-11-19 05:57:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:07,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:07,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:08,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:57:08,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:08,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:57:08,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:08,987 INFO L124 PetriNetUnfolderBase]: 124/3943 cut-off events. [2024-11-19 05:57:08,987 INFO L125 PetriNetUnfolderBase]: For 193/293 co-relation queries the response was YES. [2024-11-19 05:57:09,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 3943 events. 124/3943 cut-off events. For 193/293 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 27032 event pairs, 15 based on Foata normal form. 16/3623 useless extension candidates. Maximal degree in co-relation 4718. Up to 107 conditions per place. [2024-11-19 05:57:09,103 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2024-11-19 05:57:09,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2024-11-19 05:57:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-19 05:57:09,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-19 05:57:09,106 INFO L175 Difference]: Start difference. First operand has 555 places, 547 transitions, 1529 flow. Second operand 6 states and 3257 transitions. [2024-11-19 05:57:09,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2024-11-19 05:57:09,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:09,119 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2024-11-19 05:57:09,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2024-11-19 05:57:09,120 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-19 05:57:09,120 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2024-11-19 05:57:09,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:09,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,121 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:09,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:57:09,122 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:09,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash 653220187, now seen corresponding path program 1 times [2024-11-19 05:57:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320545749] [2024-11-19 05:57:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320545749] [2024-11-19 05:57:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320545749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684341812] [2024-11-19 05:57:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2024-11-19 05:57:09,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:09,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2024-11-19 05:57:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:11,759 INFO L124 PetriNetUnfolderBase]: 497/10763 cut-off events. [2024-11-19 05:57:11,759 INFO L125 PetriNetUnfolderBase]: For 245/255 co-relation queries the response was YES. [2024-11-19 05:57:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 10763 events. 497/10763 cut-off events. For 245/255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 112335 event pairs, 162 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 11900. Up to 618 conditions per place. [2024-11-19 05:57:11,970 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2024-11-19 05:57:11,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2024-11-19 05:57:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2024-11-19 05:57:11,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468024900962083 [2024-11-19 05:57:11,972 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1673 transitions. [2024-11-19 05:57:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2024-11-19 05:57:11,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:11,982 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2024-11-19 05:57:11,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2024-11-19 05:57:11,983 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2024-11-19 05:57:11,983 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2024-11-19 05:57:11,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:11,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:11,984 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:11,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:57:11,984 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:11,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash 395073562, now seen corresponding path program 1 times [2024-11-19 05:57:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246011711] [2024-11-19 05:57:11,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:11,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246011711] [2024-11-19 05:57:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246011711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:12,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:57:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60383644] [2024-11-19 05:57:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:57:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:57:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:57:12,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 589 [2024-11-19 05:57:12,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:12,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:12,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 589 [2024-11-19 05:57:12,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,914 INFO L124 PetriNetUnfolderBase]: 373/7895 cut-off events. [2024-11-19 05:57:13,914 INFO L125 PetriNetUnfolderBase]: For 359/421 co-relation queries the response was YES. [2024-11-19 05:57:14,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9567 conditions, 7895 events. 373/7895 cut-off events. For 359/421 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 79693 event pairs, 146 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 9053. Up to 444 conditions per place. [2024-11-19 05:57:14,059 INFO L140 encePairwiseOnDemand]: 584/589 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2024-11-19 05:57:14,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2024-11-19 05:57:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:57:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:57:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2780 transitions. [2024-11-19 05:57:14,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9439728353140917 [2024-11-19 05:57:14,062 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2780 transitions. [2024-11-19 05:57:14,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2024-11-19 05:57:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:14,073 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2024-11-19 05:57:14,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2024-11-19 05:57:14,074 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2024-11-19 05:57:14,074 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2024-11-19 05:57:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,076 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:57:14,076 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -951398275, now seen corresponding path program 1 times [2024-11-19 05:57:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789097772] [2024-11-19 05:57:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789097772] [2024-11-19 05:57:14,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789097772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344301533] [2024-11-19 05:57:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:57:14,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:57:14,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,139 INFO L124 PetriNetUnfolderBase]: 534/7743 cut-off events. [2024-11-19 05:57:16,139 INFO L125 PetriNetUnfolderBase]: For 830/900 co-relation queries the response was YES. [2024-11-19 05:57:16,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 7743 events. 534/7743 cut-off events. For 830/900 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 80147 event pairs, 275 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 9680. Up to 783 conditions per place. [2024-11-19 05:57:16,299 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2024-11-19 05:57:16,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2024-11-19 05:57:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-19 05:57:16,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-19 05:57:16,301 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1660 transitions. [2024-11-19 05:57:16,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2024-11-19 05:57:16,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:16,313 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2024-11-19 05:57:16,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2024-11-19 05:57:16,314 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2024-11-19 05:57:16,314 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2024-11-19 05:57:16,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:16,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,315 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:57:16,316 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:16,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1832317476, now seen corresponding path program 1 times [2024-11-19 05:57:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218370510] [2024-11-19 05:57:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218370510] [2024-11-19 05:57:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218370510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461141895] [2024-11-19 05:57:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:17,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:17,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:57:17,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:17,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:17,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:57:17,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:19,322 INFO L124 PetriNetUnfolderBase]: 363/7609 cut-off events. [2024-11-19 05:57:19,322 INFO L125 PetriNetUnfolderBase]: For 675/765 co-relation queries the response was YES. [2024-11-19 05:57:19,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 7609 events. 363/7609 cut-off events. For 675/765 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 75440 event pairs, 64 based on Foata normal form. 8/7100 useless extension candidates. Maximal degree in co-relation 9317. Up to 224 conditions per place. [2024-11-19 05:57:19,476 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2024-11-19 05:57:19,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2024-11-19 05:57:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-19 05:57:19,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-19 05:57:19,478 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3257 transitions. [2024-11-19 05:57:19,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2024-11-19 05:57:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:19,489 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2024-11-19 05:57:19,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2024-11-19 05:57:19,490 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2024-11-19 05:57:19,490 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2024-11-19 05:57:19,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:19,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:19,491 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:57:19,492 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 859933343, now seen corresponding path program 1 times [2024-11-19 05:57:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672236389] [2024-11-19 05:57:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672236389] [2024-11-19 05:57:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672236389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656195293] [2024-11-19 05:57:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:20,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:57:20,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:20,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:20,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:57:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:22,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [620#true, Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 3934#(= |#race~o_4~0| 0), 3938#(= |thread3Thread1of1ForFork2_~i~2#1| 0), Black: 1989#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), 260#L104-1true, Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, Black: 3932#true, Black: 604#true, 281#L82-9true, Black: 608#true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), 234#L68-12true, Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), 599#(= |#race~isNull_3~0| 0), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 1980#true]) [2024-11-19 05:57:22,396 INFO L294 olderBase$Statistics]: this new event has 684 ancestors and is cut-off event [2024-11-19 05:57:22,396 INFO L297 olderBase$Statistics]: existing Event has 578 ancestors and is cut-off event [2024-11-19 05:57:22,396 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-19 05:57:22,397 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-19 05:57:22,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 3938#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 3934#(= |#race~o_4~0| 0), Black: 1989#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), 260#L104-1true, Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, Black: 3932#true, Black: 604#true, 281#L82-9true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 608#true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), Black: 620#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 1980#true]) [2024-11-19 05:57:22,400 INFO L294 olderBase$Statistics]: this new event has 686 ancestors and is cut-off event [2024-11-19 05:57:22,400 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-19 05:57:22,400 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-19 05:57:22,400 INFO L297 olderBase$Statistics]: existing Event has 580 ancestors and is cut-off event [2024-11-19 05:57:22,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [620#true, Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 3934#(= |#race~o_4~0| 0), Black: 1989#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), 260#L104-1true, Black: 593#true, Black: 3921#true, Black: 597#true, Black: 3932#true, Black: 604#true, 281#L82-9true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 3938#(= |thread3Thread1of1ForFork2_~i~2#1| 0), 234#L68-12true, Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 1980#true]) [2024-11-19 05:57:22,467 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2024-11-19 05:57:22,467 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2024-11-19 05:57:22,467 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2024-11-19 05:57:22,467 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2024-11-19 05:57:22,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1479] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_23|)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, ~o_4~0.base=v_~o_4~0.base_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][381], [Black: 640#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~o_4~0.offset)) 0), 3934#(= |#race~o_4~0| 0), Black: 1989#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork1_~stop~1#1| 256) 0))), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), 260#L104-1true, Black: 593#true, Black: 3921#true, Black: 597#true, Black: 3932#true, Black: 604#true, 281#L82-9true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 614#(= |#race~result_7~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork2_~stop~2#1| 256) 0))), Black: 3938#(= |thread3Thread1of1ForFork2_~i~2#1| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 234#L68-12true, Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2 ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 620#true, 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 1980#true]) [2024-11-19 05:57:22,468 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2024-11-19 05:57:22,468 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2024-11-19 05:57:22,468 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2024-11-19 05:57:22,468 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2024-11-19 05:57:22,468 INFO L124 PetriNetUnfolderBase]: 331/7564 cut-off events. [2024-11-19 05:57:22,468 INFO L125 PetriNetUnfolderBase]: For 463/512 co-relation queries the response was YES. [2024-11-19 05:57:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 7564 events. 331/7564 cut-off events. For 463/512 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68330 event pairs, 39 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 9468. Up to 169 conditions per place. [2024-11-19 05:57:22,616 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2024-11-19 05:57:22,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2024-11-19 05:57:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-19 05:57:22,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-19 05:57:22,619 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3257 transitions. [2024-11-19 05:57:22,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2024-11-19 05:57:22,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:22,628 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2024-11-19 05:57:22,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2024-11-19 05:57:22,628 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -1 predicate places. [2024-11-19 05:57:22,629 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2024-11-19 05:57:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:22,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:22,630 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:57:22,630 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:22,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2133921027, now seen corresponding path program 1 times [2024-11-19 05:57:22,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:22,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467036395] [2024-11-19 05:57:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467036395] [2024-11-19 05:57:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467036395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847755888] [2024-11-19 05:57:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:23,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:23,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2024-11-19 05:57:23,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:23,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:23,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2024-11-19 05:57:23,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:25,686 INFO L124 PetriNetUnfolderBase]: 413/7689 cut-off events. [2024-11-19 05:57:25,686 INFO L125 PetriNetUnfolderBase]: For 651/741 co-relation queries the response was YES. [2024-11-19 05:57:25,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 7689 events. 413/7689 cut-off events. For 651/741 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 77113 event pairs, 62 based on Foata normal form. 16/7268 useless extension candidates. Maximal degree in co-relation 9420. Up to 276 conditions per place. [2024-11-19 05:57:25,842 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2024-11-19 05:57:25,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2024-11-19 05:57:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2024-11-19 05:57:25,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216185625353707 [2024-11-19 05:57:25,844 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3257 transitions. [2024-11-19 05:57:25,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2024-11-19 05:57:25,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:26,078 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2024-11-19 05:57:26,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2024-11-19 05:57:26,079 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2024-11-19 05:57:26,079 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2024-11-19 05:57:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:26,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:26,081 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:57:26,082 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1732435684, now seen corresponding path program 1 times [2024-11-19 05:57:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320532779] [2024-11-19 05:57:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320532779] [2024-11-19 05:57:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320532779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123218887] [2024-11-19 05:57:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:26,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2024-11-19 05:57:26,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:26,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:26,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2024-11-19 05:57:26,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:28,013 INFO L124 PetriNetUnfolderBase]: 180/7839 cut-off events. [2024-11-19 05:57:28,013 INFO L125 PetriNetUnfolderBase]: For 322/508 co-relation queries the response was YES. [2024-11-19 05:57:28,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 7839 events. 180/7839 cut-off events. For 322/508 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 71869 event pairs, 69 based on Foata normal form. 6/7496 useless extension candidates. Maximal degree in co-relation 9594. Up to 166 conditions per place. [2024-11-19 05:57:28,199 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2024-11-19 05:57:28,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2024-11-19 05:57:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2024-11-19 05:57:28,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411431805319751 [2024-11-19 05:57:28,201 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1663 transitions. [2024-11-19 05:57:28,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2024-11-19 05:57:28,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:28,213 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2024-11-19 05:57:28,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2024-11-19 05:57:28,214 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2024-11-19 05:57:28,214 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2024-11-19 05:57:28,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:28,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:28,214 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:57:28,214 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:28,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash 250594319, now seen corresponding path program 1 times [2024-11-19 05:57:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929032898] [2024-11-19 05:57:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:28,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929032898] [2024-11-19 05:57:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929032898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523189118] [2024-11-19 05:57:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:28,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:57:28,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:28,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:28,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:57:28,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:30,720 INFO L124 PetriNetUnfolderBase]: 468/9815 cut-off events. [2024-11-19 05:57:30,721 INFO L125 PetriNetUnfolderBase]: For 574/648 co-relation queries the response was YES. [2024-11-19 05:57:30,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 9815 events. 468/9815 cut-off events. For 574/648 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 99540 event pairs, 177 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11848. Up to 516 conditions per place. [2024-11-19 05:57:30,837 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2024-11-19 05:57:30,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2024-11-19 05:57:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-19 05:57:30,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-19 05:57:30,838 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1660 transitions. [2024-11-19 05:57:30,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2024-11-19 05:57:30,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:30,846 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2024-11-19 05:57:30,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2024-11-19 05:57:30,847 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -7 predicate places. [2024-11-19 05:57:30,847 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2024-11-19 05:57:30,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:30,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:30,847 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:57:30,848 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2024-11-19 05:57:30,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash 461798003, now seen corresponding path program 1 times [2024-11-19 05:57:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735471921] [2024-11-19 05:57:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:30,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-19 05:57:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735471921] [2024-11-19 05:57:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735471921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069419094] [2024-11-19 05:57:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:31,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 589 [2024-11-19 05:57:31,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:31,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:31,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 589 [2024-11-19 05:57:31,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:32,726 INFO L124 PetriNetUnfolderBase]: 493/7668 cut-off events. [2024-11-19 05:57:32,727 INFO L125 PetriNetUnfolderBase]: For 731/777 co-relation queries the response was YES. [2024-11-19 05:57:32,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 7668 events. 493/7668 cut-off events. For 731/777 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 78478 event pairs, 260 based on Foata normal form. 0/7276 useless extension candidates. Maximal degree in co-relation 9560. Up to 746 conditions per place. [2024-11-19 05:57:32,825 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2024-11-19 05:57:32,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2024-11-19 05:57:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2024-11-19 05:57:32,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394453876627051 [2024-11-19 05:57:32,826 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1660 transitions. [2024-11-19 05:57:32,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2024-11-19 05:57:32,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:32,832 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2024-11-19 05:57:32,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2024-11-19 05:57:32,833 INFO L277 CegarLoopForPetriNet]: 545 programPoint places, -8 predicate places. [2024-11-19 05:57:32,833 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2024-11-19 05:57:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:32,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2024-11-19 05:57:32,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2024-11-19 05:57:32,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2024-11-19 05:57:32,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2024-11-19 05:57:32,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2024-11-19 05:57:32,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2024-11-19 05:57:32,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2024-11-19 05:57:32,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2024-11-19 05:57:32,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2024-11-19 05:57:32,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2024-11-19 05:57:32,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2024-11-19 05:57:32,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2024-11-19 05:57:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:57:32,843 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,849 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:32,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:32,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:32 BasicIcfg [2024-11-19 05:57:32,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:32,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:32,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:32,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:32,856 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:35" (3/4) ... [2024-11-19 05:57:32,858 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:32,862 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:32,862 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:32,862 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:57:32,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-19 05:57:32,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:32,871 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:32,871 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:32,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:32,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:32,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:32,985 INFO L158 Benchmark]: Toolchain (without parser) took 58573.90ms. Allocated memory was 167.8MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 99.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 813.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,985 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:32,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.44ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.61ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 139.1MB in the end (delta: -55.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,986 INFO L158 Benchmark]: Boogie Preprocessor took 93.82ms. Allocated memory is still 167.8MB. Free memory was 139.1MB in the beginning and 135.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,986 INFO L158 Benchmark]: RCFGBuilder took 910.06ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 92.9MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,987 INFO L158 Benchmark]: TraceAbstraction took 56988.61ms. Allocated memory was 167.8MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 92.3MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-19 05:57:32,987 INFO L158 Benchmark]: Witness Printer took 129.12ms. Allocated memory is still 4.1GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:57:32,988 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.21ms. Allocated memory is still 167.8MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.44ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.61ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 139.1MB in the end (delta: -55.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.82ms. Allocated memory is still 167.8MB. Free memory was 139.1MB in the beginning and 135.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 910.06ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 92.9MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 56988.61ms. Allocated memory was 167.8MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 92.3MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 129.12ms. Allocated memory is still 4.1GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 68]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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, 857 locations, 83 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: 56.7s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 45.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3962 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2583 mSDsluCounter, 1425 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1128 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6856 IncrementalHoareTripleChecker+Invalid, 7593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 297 mSDtfsCounter, 6856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=25, InterpolantAutomatonStates: 162, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 10192 NumberOfCodeBlocks, 9832 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10679 ConstructedInterpolants, 0 QuantifiedInterpolants, 12741 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6738/6885 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:33,023 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