./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f 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-name-comparator-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:36:32,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:36:32,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:36:32,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:36:32,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:36:32,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:36:32,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:36:32,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:36:32,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:36:32,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:36:32,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:36:32,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:36:32,666 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:36:32,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:36:32,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:36:32,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:36:32,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:36:32,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:36:32,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:36:32,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:36:32,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:36:32,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:36:32,672 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:36:32,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:36:32,673 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:36:32,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:36:32,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:36:32,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:36:32,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:36:32,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:36:32,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:36:32,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:36:32,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:36:32,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:36:32,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:36:32,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:36:32,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:36:32,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:36:32,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:36:32,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:36:32,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:36:32,676 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2024-11-10 14:36:32,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:36:32,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:36:32,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:36:32,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:36:32,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:36:32,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-10 14:36:34,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:36:34,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:36:34,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-10 14:36:34,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a593a0b/ac4d24c69d914871ab5e3393c84ae1bf/FLAG479c7fc82 [2024-11-10 14:36:34,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a593a0b/ac4d24c69d914871ab5e3393c84ae1bf [2024-11-10 14:36:34,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:36:34,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:36:34,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:36:34,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:36:34,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:36:34,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:36:34" (1/1) ... [2024-11-10 14:36:34,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6576b820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:34, skipping insertion in model container [2024-11-10 14:36:34,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:36:34" (1/1) ... [2024-11-10 14:36:34,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:36:35,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:36:35,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:36:35,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:36:35,106 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:36:35,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35 WrapperNode [2024-11-10 14:36:35,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:36:35,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:36:35,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:36:35,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:36:35,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,163 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 587 [2024-11-10 14:36:35,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:36:35,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:36:35,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:36:35,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:36:35,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:36:35,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:36:35,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:36:35,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:36:35,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (1/1) ... [2024-11-10 14:36:35,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:36:35,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:36:35,250 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-10 14:36:35,259 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-10 14:36:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:36:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:36:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:36:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:36:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:36:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:36:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:36:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:36:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:36:35,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:36:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:36:35,303 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:36:35,421 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:36:35,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:36:35,955 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:36:35,955 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:36:35,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:36:35,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:36:35,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:36:35 BoogieIcfgContainer [2024-11-10 14:36:35,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:36:35,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:36:35,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:36:35,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:36:35,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:36:34" (1/3) ... [2024-11-10 14:36:35,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb42665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:36:35, skipping insertion in model container [2024-11-10 14:36:35,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:36:35" (2/3) ... [2024-11-10 14:36:35,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb42665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:36:35, skipping insertion in model container [2024-11-10 14:36:35,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:36:35" (3/3) ... [2024-11-10 14:36:35,988 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2024-11-10 14:36:36,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:36:36,005 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-11-10 14:36:36,005 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:36:36,149 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:36:36,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 741 places, 775 transitions, 1564 flow [2024-11-10 14:36:36,464 INFO L124 PetriNetUnfolderBase]: 41/773 cut-off events. [2024-11-10 14:36:36,465 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:36:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 773 events. 41/773 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2096 event pairs, 0 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2024-11-10 14:36:36,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 741 places, 775 transitions, 1564 flow [2024-11-10 14:36:36,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 719 places, 751 transitions, 1514 flow [2024-11-10 14:36:36,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:36:36,545 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;@6cfa8fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:36:36,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2024-11-10 14:36:36,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:36:36,548 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-10 14:36:36,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:36:36,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:36,549 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] [2024-11-10 14:36:36,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:36,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1462738433, now seen corresponding path program 1 times [2024-11-10 14:36:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092217957] [2024-11-10 14:36:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:36,756 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-10 14:36:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092217957] [2024-11-10 14:36:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092217957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911500036] [2024-11-10 14:36:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:36,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:36,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:36,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 751 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:36,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:36,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:37,175 INFO L124 PetriNetUnfolderBase]: 133/2403 cut-off events. [2024-11-10 14:36:37,176 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2024-11-10 14:36:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 2403 events. 133/2403 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15114 event pairs, 35 based on Foata normal form. 66/1972 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2024-11-10 14:36:37,201 INFO L140 encePairwiseOnDemand]: 759/775 looper letters, 17 selfloop transitions, 2 changer transitions 2/737 dead transitions. [2024-11-10 14:36:37,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 737 transitions, 1524 flow [2024-11-10 14:36:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-11-10 14:36:37,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2024-11-10 14:36:37,220 INFO L175 Difference]: Start difference. First operand has 719 places, 751 transitions, 1514 flow. Second operand 3 states and 2250 transitions. [2024-11-10 14:36:37,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 737 transitions, 1524 flow [2024-11-10 14:36:37,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 737 transitions, 1516 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:36:37,251 INFO L231 Difference]: Finished difference. Result has 716 places, 735 transitions, 1478 flow [2024-11-10 14:36:37,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=716, PETRI_TRANSITIONS=735} [2024-11-10 14:36:37,265 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -3 predicate places. [2024-11-10 14:36:37,265 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 735 transitions, 1478 flow [2024-11-10 14:36:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:37,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:37,268 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] [2024-11-10 14:36:37,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:36:37,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:37,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash -48094637, now seen corresponding path program 1 times [2024-11-10 14:36:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188833726] [2024-11-10 14:36:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:37,339 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-10 14:36:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188833726] [2024-11-10 14:36:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188833726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229388621] [2024-11-10 14:36:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:37,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:37,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:37,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 735 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:37,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:37,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:37,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:37,734 INFO L124 PetriNetUnfolderBase]: 133/2403 cut-off events. [2024-11-10 14:36:37,734 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-10 14:36:37,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 2403 events. 133/2403 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14745 event pairs, 35 based on Foata normal form. 0/1903 useless extension candidates. Maximal degree in co-relation 2468. Up to 88 conditions per place. [2024-11-10 14:36:37,760 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 2 changer transitions 0/734 dead transitions. [2024-11-10 14:36:37,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 734 transitions, 1514 flow [2024-11-10 14:36:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-10 14:36:37,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621505376344086 [2024-11-10 14:36:37,765 INFO L175 Difference]: Start difference. First operand has 716 places, 735 transitions, 1478 flow. Second operand 3 states and 2237 transitions. [2024-11-10 14:36:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 734 transitions, 1514 flow [2024-11-10 14:36:37,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 734 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:37,778 INFO L231 Difference]: Finished difference. Result has 713 places, 734 transitions, 1476 flow [2024-11-10 14:36:37,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=713, PETRI_TRANSITIONS=734} [2024-11-10 14:36:37,780 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -6 predicate places. [2024-11-10 14:36:37,780 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 734 transitions, 1476 flow [2024-11-10 14:36:37,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:37,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:37,782 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] [2024-11-10 14:36:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:36:37,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1395292847, now seen corresponding path program 1 times [2024-11-10 14:36:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372042509] [2024-11-10 14:36:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:37,842 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-10 14:36:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372042509] [2024-11-10 14:36:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372042509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:37,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:37,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300568132] [2024-11-10 14:36:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:37,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:37,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:38,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:38,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:38,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:38,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:38,368 INFO L124 PetriNetUnfolderBase]: 130/2941 cut-off events. [2024-11-10 14:36:38,368 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-10 14:36:38,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2941 events. 130/2941 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17959 event pairs, 8 based on Foata normal form. 0/2330 useless extension candidates. Maximal degree in co-relation 2947. Up to 34 conditions per place. [2024-11-10 14:36:38,388 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-11-10 14:36:38,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2024-11-10 14:36:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-10 14:36:38,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621505376344086 [2024-11-10 14:36:38,392 INFO L175 Difference]: Start difference. First operand has 713 places, 734 transitions, 1476 flow. Second operand 3 states and 2237 transitions. [2024-11-10 14:36:38,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2024-11-10 14:36:38,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:38,401 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2024-11-10 14:36:38,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2024-11-10 14:36:38,403 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -7 predicate places. [2024-11-10 14:36:38,403 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2024-11-10 14:36:38,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:38,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:38,405 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] [2024-11-10 14:36:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:36:38,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1640290576, now seen corresponding path program 1 times [2024-11-10 14:36:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140113371] [2024-11-10 14:36:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:38,453 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-10 14:36:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140113371] [2024-11-10 14:36:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140113371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:38,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:38,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559956627] [2024-11-10 14:36:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:38,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 775 [2024-11-10 14:36:38,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-10 14:36:38,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:38,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 775 [2024-11-10 14:36:38,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:38,663 INFO L124 PetriNetUnfolderBase]: 44/1007 cut-off events. [2024-11-10 14:36:38,664 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:36:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 1007 events. 44/1007 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3894 event pairs, 6 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 995. Up to 26 conditions per place. [2024-11-10 14:36:38,677 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 13 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-10 14:36:38,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1502 flow [2024-11-10 14:36:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2245 transitions. [2024-11-10 14:36:38,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655913978494624 [2024-11-10 14:36:38,681 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2245 transitions. [2024-11-10 14:36:38,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1502 flow [2024-11-10 14:36:38,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:38,688 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2024-11-10 14:36:38,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2024-11-10 14:36:38,690 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -8 predicate places. [2024-11-10 14:36:38,691 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2024-11-10 14:36:38,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-10 14:36:38,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:38,692 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] [2024-11-10 14:36:38,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:36:38,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1815300398, now seen corresponding path program 1 times [2024-11-10 14:36:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988418428] [2024-11-10 14:36:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:38,742 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-10 14:36:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988418428] [2024-11-10 14:36:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988418428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880146972] [2024-11-10 14:36:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:38,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 775 [2024-11-10 14:36:38,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-10 14:36:38,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:38,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 775 [2024-11-10 14:36:38,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:39,001 INFO L124 PetriNetUnfolderBase]: 91/2111 cut-off events. [2024-11-10 14:36:39,001 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-10 14:36:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 2111 events. 91/2111 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10653 event pairs, 5 based on Foata normal form. 0/1682 useless extension candidates. Maximal degree in co-relation 2087. Up to 23 conditions per place. [2024-11-10 14:36:39,024 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 12 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-10 14:36:39,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1498 flow [2024-11-10 14:36:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-11-10 14:36:39,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664516129032258 [2024-11-10 14:36:39,028 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2247 transitions. [2024-11-10 14:36:39,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1498 flow [2024-11-10 14:36:39,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1494 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:39,076 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2024-11-10 14:36:39,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2024-11-10 14:36:39,079 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -9 predicate places. [2024-11-10 14:36:39,079 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2024-11-10 14:36:39,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-10 14:36:39,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:39,081 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] [2024-11-10 14:36:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:36:39,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2036585089, now seen corresponding path program 1 times [2024-11-10 14:36:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849344692] [2024-11-10 14:36:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:39,123 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-10 14:36:39,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:39,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849344692] [2024-11-10 14:36:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849344692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924053461] [2024-11-10 14:36:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:39,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 775 [2024-11-10 14:36:39,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 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-10 14:36:39,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:39,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 775 [2024-11-10 14:36:39,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:39,629 INFO L124 PetriNetUnfolderBase]: 182/4042 cut-off events. [2024-11-10 14:36:39,630 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-10 14:36:39,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 4042 events. 182/4042 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 28093 event pairs, 12 based on Foata normal form. 0/3195 useless extension candidates. Maximal degree in co-relation 4038. Up to 44 conditions per place. [2024-11-10 14:36:39,655 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 19 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-11-10 14:36:39,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1510 flow [2024-11-10 14:36:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2233 transitions. [2024-11-10 14:36:39,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604301075268817 [2024-11-10 14:36:39,659 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2233 transitions. [2024-11-10 14:36:39,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1510 flow [2024-11-10 14:36:39,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:39,669 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2024-11-10 14:36:39,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2024-11-10 14:36:39,671 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -10 predicate places. [2024-11-10 14:36:39,672 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2024-11-10 14:36:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 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-10 14:36:39,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:39,673 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:36:39,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:39,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1084041377, now seen corresponding path program 1 times [2024-11-10 14:36:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218492479] [2024-11-10 14:36:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:39,706 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-10 14:36:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218492479] [2024-11-10 14:36:39,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218492479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:39,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:39,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730327162] [2024-11-10 14:36:39,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:39,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:39,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:39,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:39,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:39,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:39,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:39,917 INFO L124 PetriNetUnfolderBase]: 46/988 cut-off events. [2024-11-10 14:36:39,917 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-11-10 14:36:39,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 988 events. 46/988 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3826 event pairs, 8 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 955. Up to 35 conditions per place. [2024-11-10 14:36:39,935 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-11-10 14:36:39,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1504 flow [2024-11-10 14:36:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-10 14:36:39,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621505376344086 [2024-11-10 14:36:39,939 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2237 transitions. [2024-11-10 14:36:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1504 flow [2024-11-10 14:36:39,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:39,949 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2024-11-10 14:36:39,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2024-11-10 14:36:39,950 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -11 predicate places. [2024-11-10 14:36:39,951 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2024-11-10 14:36:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-10 14:36:39,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:39,952 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] [2024-11-10 14:36:39,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:36:39,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 37646490, now seen corresponding path program 1 times [2024-11-10 14:36:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700826284] [2024-11-10 14:36:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:40,011 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-10 14:36:40,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700826284] [2024-11-10 14:36:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700826284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:40,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814960494] [2024-11-10 14:36:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:40,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:40,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 775 [2024-11-10 14:36:40,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-10 14:36:40,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:40,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 775 [2024-11-10 14:36:40,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:40,188 INFO L124 PetriNetUnfolderBase]: 44/1003 cut-off events. [2024-11-10 14:36:40,188 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:36:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 1003 events. 44/1003 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3614 event pairs, 6 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 953. Up to 26 conditions per place. [2024-11-10 14:36:40,198 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 13 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-10 14:36:40,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1494 flow [2024-11-10 14:36:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2245 transitions. [2024-11-10 14:36:40,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655913978494624 [2024-11-10 14:36:40,202 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2245 transitions. [2024-11-10 14:36:40,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1494 flow [2024-11-10 14:36:40,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:40,208 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2024-11-10 14:36:40,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2024-11-10 14:36:40,210 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -12 predicate places. [2024-11-10 14:36:40,211 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2024-11-10 14:36:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-10 14:36:40,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:40,212 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] [2024-11-10 14:36:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:36:40,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1667188782, now seen corresponding path program 1 times [2024-11-10 14:36:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365572441] [2024-11-10 14:36:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:40,258 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-10 14:36:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365572441] [2024-11-10 14:36:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365572441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041776592] [2024-11-10 14:36:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:40,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:40,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:40,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 775 [2024-11-10 14:36:40,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-10 14:36:40,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:40,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 775 [2024-11-10 14:36:40,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:40,376 INFO L124 PetriNetUnfolderBase]: 31/737 cut-off events. [2024-11-10 14:36:40,376 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-10 14:36:40,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 737 events. 31/737 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2496 event pairs, 5 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 676. Up to 23 conditions per place. [2024-11-10 14:36:40,392 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 12 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-11-10 14:36:40,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1490 flow [2024-11-10 14:36:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-11-10 14:36:40,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664516129032258 [2024-11-10 14:36:40,396 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2247 transitions. [2024-11-10 14:36:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1490 flow [2024-11-10 14:36:40,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:40,403 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2024-11-10 14:36:40,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2024-11-10 14:36:40,405 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -13 predicate places. [2024-11-10 14:36:40,405 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2024-11-10 14:36:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-10 14:36:40,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:40,407 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] [2024-11-10 14:36:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:36:40,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:40,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1547224239, now seen corresponding path program 1 times [2024-11-10 14:36:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371300994] [2024-11-10 14:36:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:40,446 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-10 14:36:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371300994] [2024-11-10 14:36:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371300994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841920678] [2024-11-10 14:36:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:40,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:40,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 775 [2024-11-10 14:36:40,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 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-10 14:36:40,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:40,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 775 [2024-11-10 14:36:40,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:40,602 INFO L124 PetriNetUnfolderBase]: 50/1001 cut-off events. [2024-11-10 14:36:40,602 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-10 14:36:40,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 1001 events. 50/1001 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4123 event pairs, 12 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 953. Up to 44 conditions per place. [2024-11-10 14:36:40,619 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 19 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-11-10 14:36:40,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1502 flow [2024-11-10 14:36:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2233 transitions. [2024-11-10 14:36:40,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604301075268817 [2024-11-10 14:36:40,622 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2233 transitions. [2024-11-10 14:36:40,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1502 flow [2024-11-10 14:36:40,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:40,630 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2024-11-10 14:36:40,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2024-11-10 14:36:40,631 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -14 predicate places. [2024-11-10 14:36:40,631 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2024-11-10 14:36:40,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 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-10 14:36:40,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:40,632 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] [2024-11-10 14:36:40,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:36:40,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:40,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1905013270, now seen corresponding path program 1 times [2024-11-10 14:36:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:40,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992363184] [2024-11-10 14:36:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:41,081 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-10 14:36:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992363184] [2024-11-10 14:36:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992363184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968969088] [2024-11-10 14:36:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:41,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:41,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 775 [2024-11-10 14:36:41,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 6 states, 6 states have (on average 735.5) internal successors, (4413), 6 states have internal predecessors, (4413), 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-10 14:36:41,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:41,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 775 [2024-11-10 14:36:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:41,436 INFO L124 PetriNetUnfolderBase]: 131/2348 cut-off events. [2024-11-10 14:36:41,436 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-10 14:36:41,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 2348 events. 131/2348 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 13139 event pairs, 24 based on Foata normal form. 0/1870 useless extension candidates. Maximal degree in co-relation 2340. Up to 84 conditions per place. [2024-11-10 14:36:41,466 INFO L140 encePairwiseOnDemand]: 769/775 looper letters, 20 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2024-11-10 14:36:41,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 725 transitions, 1508 flow [2024-11-10 14:36:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2024-11-10 14:36:41,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9526881720430107 [2024-11-10 14:36:41,472 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 6 states and 4430 transitions. [2024-11-10 14:36:41,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 725 transitions, 1508 flow [2024-11-10 14:36:41,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:41,479 INFO L231 Difference]: Finished difference. Result has 707 places, 725 transitions, 1464 flow [2024-11-10 14:36:41,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=725} [2024-11-10 14:36:41,480 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -12 predicate places. [2024-11-10 14:36:41,480 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 725 transitions, 1464 flow [2024-11-10 14:36:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 735.5) internal successors, (4413), 6 states have internal predecessors, (4413), 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-10 14:36:41,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:41,483 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] [2024-11-10 14:36:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:36:41,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1996266191, now seen corresponding path program 1 times [2024-11-10 14:36:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502544006] [2024-11-10 14:36:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:41,526 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-10 14:36:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502544006] [2024-11-10 14:36:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502544006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565831644] [2024-11-10 14:36:41,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:41,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 775 [2024-11-10 14:36:41,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 725 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-10 14:36:41,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:41,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 775 [2024-11-10 14:36:41,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:41,743 INFO L124 PetriNetUnfolderBase]: 52/1223 cut-off events. [2024-11-10 14:36:41,743 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-10 14:36:41,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1223 events. 52/1223 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4266 event pairs, 3 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1235. Up to 18 conditions per place. [2024-11-10 14:36:41,757 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 9 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2024-11-10 14:36:41,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1484 flow [2024-11-10 14:36:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2024-11-10 14:36:41,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9690322580645161 [2024-11-10 14:36:41,760 INFO L175 Difference]: Start difference. First operand has 707 places, 725 transitions, 1464 flow. Second operand 3 states and 2253 transitions. [2024-11-10 14:36:41,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1484 flow [2024-11-10 14:36:41,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 724 transitions, 1474 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:41,767 INFO L231 Difference]: Finished difference. Result has 703 places, 724 transitions, 1456 flow [2024-11-10 14:36:41,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=703, PETRI_TRANSITIONS=724} [2024-11-10 14:36:41,768 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -16 predicate places. [2024-11-10 14:36:41,769 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 724 transitions, 1456 flow [2024-11-10 14:36:41,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-10 14:36:41,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:41,770 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] [2024-11-10 14:36:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:36:41,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -873736294, now seen corresponding path program 1 times [2024-11-10 14:36:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710075803] [2024-11-10 14:36:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:41,801 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-10 14:36:41,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:41,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710075803] [2024-11-10 14:36:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710075803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:41,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679508408] [2024-11-10 14:36:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:41,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:41,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 775 [2024-11-10 14:36:41,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 724 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-10 14:36:41,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:41,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 775 [2024-11-10 14:36:41,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:41,935 INFO L124 PetriNetUnfolderBase]: 47/1001 cut-off events. [2024-11-10 14:36:41,936 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:36:41,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 1001 events. 47/1001 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3910 event pairs, 7 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 893. Up to 27 conditions per place. [2024-11-10 14:36:41,950 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 13 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2024-11-10 14:36:41,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 724 transitions, 1487 flow [2024-11-10 14:36:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2251 transitions. [2024-11-10 14:36:41,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681720430107527 [2024-11-10 14:36:41,953 INFO L175 Difference]: Start difference. First operand has 703 places, 724 transitions, 1456 flow. Second operand 3 states and 2251 transitions. [2024-11-10 14:36:41,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 724 transitions, 1487 flow [2024-11-10 14:36:41,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 724 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:41,961 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2024-11-10 14:36:41,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2024-11-10 14:36:41,962 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -17 predicate places. [2024-11-10 14:36:41,962 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2024-11-10 14:36:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-10 14:36:41,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:41,963 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] [2024-11-10 14:36:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:36:41,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:41,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 779763038, now seen corresponding path program 1 times [2024-11-10 14:36:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036148036] [2024-11-10 14:36:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:41,990 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-10 14:36:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036148036] [2024-11-10 14:36:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036148036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645575423] [2024-11-10 14:36:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:41,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:42,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:42,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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-10 14:36:42,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:42,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:42,214 INFO L124 PetriNetUnfolderBase]: 65/1274 cut-off events. [2024-11-10 14:36:42,214 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2024-11-10 14:36:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 1274 events. 65/1274 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5988 event pairs, 13 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2024-11-10 14:36:42,230 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 19 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-10 14:36:42,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1497 flow [2024-11-10 14:36:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-10 14:36:42,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.963010752688172 [2024-11-10 14:36:42,235 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2239 transitions. [2024-11-10 14:36:42,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1497 flow [2024-11-10 14:36:42,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:42,253 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2024-11-10 14:36:42,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2024-11-10 14:36:42,255 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -18 predicate places. [2024-11-10 14:36:42,255 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2024-11-10 14:36:42,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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-10 14:36:42,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:42,258 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] [2024-11-10 14:36:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:36:42,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:42,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -484960858, now seen corresponding path program 1 times [2024-11-10 14:36:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444867112] [2024-11-10 14:36:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:42,305 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-10 14:36:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444867112] [2024-11-10 14:36:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444867112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:42,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861019429] [2024-11-10 14:36:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:42,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:42,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:42,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 775 [2024-11-10 14:36:42,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-10 14:36:42,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:42,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 775 [2024-11-10 14:36:42,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:42,622 INFO L124 PetriNetUnfolderBase]: 47/999 cut-off events. [2024-11-10 14:36:42,626 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-10 14:36:42,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 999 events. 47/999 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3599 event pairs, 2 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2024-11-10 14:36:42,662 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 13 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2024-11-10 14:36:42,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1483 flow [2024-11-10 14:36:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2251 transitions. [2024-11-10 14:36:42,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681720430107527 [2024-11-10 14:36:42,670 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2251 transitions. [2024-11-10 14:36:42,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1483 flow [2024-11-10 14:36:42,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:42,683 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2024-11-10 14:36:42,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2024-11-10 14:36:42,690 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -19 predicate places. [2024-11-10 14:36:42,691 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2024-11-10 14:36:42,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-10 14:36:42,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:42,692 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] [2024-11-10 14:36:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:36:42,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:42,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1555917697, now seen corresponding path program 1 times [2024-11-10 14:36:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:42,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863385908] [2024-11-10 14:36:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:42,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-10 14:36:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863385908] [2024-11-10 14:36:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863385908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495955041] [2024-11-10 14:36:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:42,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 775 [2024-11-10 14:36:42,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 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-10 14:36:42,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:42,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 775 [2024-11-10 14:36:42,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:43,370 INFO L124 PetriNetUnfolderBase]: 383/5333 cut-off events. [2024-11-10 14:36:43,370 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 14:36:43,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 5333 events. 383/5333 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 40951 event pairs, 100 based on Foata normal form. 0/4263 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2024-11-10 14:36:43,401 INFO L140 encePairwiseOnDemand]: 763/775 looper letters, 26 selfloop transitions, 2 changer transitions 0/714 dead transitions. [2024-11-10 14:36:43,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 714 transitions, 1493 flow [2024-11-10 14:36:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2213 transitions. [2024-11-10 14:36:43,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9518279569892473 [2024-11-10 14:36:43,404 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2213 transitions. [2024-11-10 14:36:43,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 714 transitions, 1493 flow [2024-11-10 14:36:43,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 714 transitions, 1489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:43,414 INFO L231 Difference]: Finished difference. Result has 691 places, 713 transitions, 1440 flow [2024-11-10 14:36:43,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=691, PETRI_TRANSITIONS=713} [2024-11-10 14:36:43,415 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -28 predicate places. [2024-11-10 14:36:43,415 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 713 transitions, 1440 flow [2024-11-10 14:36:43,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 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-10 14:36:43,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:43,416 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] [2024-11-10 14:36:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:36:43,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -588238656, now seen corresponding path program 1 times [2024-11-10 14:36:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138526671] [2024-11-10 14:36:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:43,447 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-10 14:36:43,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:43,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138526671] [2024-11-10 14:36:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138526671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:43,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:43,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:43,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713275335] [2024-11-10 14:36:43,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:43,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:43,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:43,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 775 [2024-11-10 14:36:43,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 713 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 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-10 14:36:43,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:43,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 775 [2024-11-10 14:36:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:44,060 INFO L124 PetriNetUnfolderBase]: 398/5527 cut-off events. [2024-11-10 14:36:44,060 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-10 14:36:44,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 5527 events. 398/5527 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43172 event pairs, 100 based on Foata normal form. 0/4484 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2024-11-10 14:36:44,088 INFO L140 encePairwiseOnDemand]: 763/775 looper letters, 26 selfloop transitions, 2 changer transitions 0/706 dead transitions. [2024-11-10 14:36:44,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 706 transitions, 1483 flow [2024-11-10 14:36:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2213 transitions. [2024-11-10 14:36:44,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9518279569892473 [2024-11-10 14:36:44,093 INFO L175 Difference]: Start difference. First operand has 691 places, 713 transitions, 1440 flow. Second operand 3 states and 2213 transitions. [2024-11-10 14:36:44,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 706 transitions, 1483 flow [2024-11-10 14:36:44,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 706 transitions, 1483 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:44,100 INFO L231 Difference]: Finished difference. Result has 684 places, 705 transitions, 1434 flow [2024-11-10 14:36:44,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=705} [2024-11-10 14:36:44,102 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -35 predicate places. [2024-11-10 14:36:44,102 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 705 transitions, 1434 flow [2024-11-10 14:36:44,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 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-10 14:36:44,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:44,103 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-10 14:36:44,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:36:44,103 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1551863129, now seen corresponding path program 1 times [2024-11-10 14:36:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:44,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596357932] [2024-11-10 14:36:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:44,133 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-10 14:36:44,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:44,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596357932] [2024-11-10 14:36:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596357932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:44,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:44,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737747959] [2024-11-10 14:36:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:44,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:44,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:44,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:44,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 705 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-10 14:36:44,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:44,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:44,339 INFO L124 PetriNetUnfolderBase]: 79/1466 cut-off events. [2024-11-10 14:36:44,340 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-10 14:36:44,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1466 events. 79/1466 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7753 event pairs, 13 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2024-11-10 14:36:44,359 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 19 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2024-11-10 14:36:44,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 705 transitions, 1477 flow [2024-11-10 14:36:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-10 14:36:44,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.963010752688172 [2024-11-10 14:36:44,362 INFO L175 Difference]: Start difference. First operand has 684 places, 705 transitions, 1434 flow. Second operand 3 states and 2239 transitions. [2024-11-10 14:36:44,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 705 transitions, 1477 flow [2024-11-10 14:36:44,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 705 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:44,370 INFO L231 Difference]: Finished difference. Result has 685 places, 704 transitions, 1436 flow [2024-11-10 14:36:44,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=685, PETRI_TRANSITIONS=704} [2024-11-10 14:36:44,371 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -34 predicate places. [2024-11-10 14:36:44,371 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 704 transitions, 1436 flow [2024-11-10 14:36:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-10 14:36:44,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:44,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:36:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:36:44,372 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash -749703930, now seen corresponding path program 1 times [2024-11-10 14:36:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468589959] [2024-11-10 14:36:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:44,401 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-10 14:36:44,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:44,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468589959] [2024-11-10 14:36:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468589959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:44,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820972747] [2024-11-10 14:36:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:44,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:44,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 775 [2024-11-10 14:36:44,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 704 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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-10 14:36:44,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:44,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 775 [2024-11-10 14:36:44,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:44,648 INFO L124 PetriNetUnfolderBase]: 116/2292 cut-off events. [2024-11-10 14:36:44,648 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-10 14:36:44,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 2292 events. 116/2292 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12445 event pairs, 4 based on Foata normal form. 0/1909 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2024-11-10 14:36:44,671 INFO L140 encePairwiseOnDemand]: 760/775 looper letters, 17 selfloop transitions, 9 changer transitions 0/703 dead transitions. [2024-11-10 14:36:44,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 703 transitions, 1487 flow [2024-11-10 14:36:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2024-11-10 14:36:44,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595698924731183 [2024-11-10 14:36:44,675 INFO L175 Difference]: Start difference. First operand has 685 places, 704 transitions, 1436 flow. Second operand 3 states and 2231 transitions. [2024-11-10 14:36:44,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 703 transitions, 1487 flow [2024-11-10 14:36:44,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 703 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:44,683 INFO L231 Difference]: Finished difference. Result has 680 places, 702 transitions, 1463 flow [2024-11-10 14:36:44,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=680, PETRI_TRANSITIONS=702} [2024-11-10 14:36:44,685 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -39 predicate places. [2024-11-10 14:36:44,685 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 702 transitions, 1463 flow [2024-11-10 14:36:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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-10 14:36:44,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:44,686 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-10 14:36:44,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:36:44,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:44,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -627886650, now seen corresponding path program 1 times [2024-11-10 14:36:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104885043] [2024-11-10 14:36:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:44,729 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-10 14:36:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:44,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104885043] [2024-11-10 14:36:44,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104885043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:44,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:44,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171216058] [2024-11-10 14:36:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:44,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:36:44,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 702 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-10 14:36:44,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:44,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:36:44,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:44,984 INFO L124 PetriNetUnfolderBase]: 112/2246 cut-off events. [2024-11-10 14:36:44,984 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2024-11-10 14:36:45,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 2246 events. 112/2246 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14438 event pairs, 10 based on Foata normal form. 1/1877 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2024-11-10 14:36:45,013 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 20 selfloop transitions, 3 changer transitions 0/702 dead transitions. [2024-11-10 14:36:45,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 702 transitions, 1510 flow [2024-11-10 14:36:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2024-11-10 14:36:45,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9647311827956989 [2024-11-10 14:36:45,017 INFO L175 Difference]: Start difference. First operand has 680 places, 702 transitions, 1463 flow. Second operand 3 states and 2243 transitions. [2024-11-10 14:36:45,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 702 transitions, 1510 flow [2024-11-10 14:36:45,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 702 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:45,027 INFO L231 Difference]: Finished difference. Result has 680 places, 701 transitions, 1458 flow [2024-11-10 14:36:45,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=680, PETRI_TRANSITIONS=701} [2024-11-10 14:36:45,028 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -39 predicate places. [2024-11-10 14:36:45,028 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 701 transitions, 1458 flow [2024-11-10 14:36:45,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-10 14:36:45,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:45,029 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] [2024-11-10 14:36:45,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:36:45,029 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash -519511089, now seen corresponding path program 1 times [2024-11-10 14:36:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628716819] [2024-11-10 14:36:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:45,063 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-10 14:36:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628716819] [2024-11-10 14:36:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628716819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832502442] [2024-11-10 14:36:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:45,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 775 [2024-11-10 14:36:45,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 701 transitions, 1458 flow. Second operand has 3 states, 3 states have (on average 734.6666666666666) internal successors, (2204), 3 states have internal predecessors, (2204), 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-10 14:36:45,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:45,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 775 [2024-11-10 14:36:45,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:45,263 INFO L124 PetriNetUnfolderBase]: 76/1485 cut-off events. [2024-11-10 14:36:45,264 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-10 14:36:45,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1485 events. 76/1485 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7770 event pairs, 4 based on Foata normal form. 1/1269 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2024-11-10 14:36:45,283 INFO L140 encePairwiseOnDemand]: 760/775 looper letters, 13 selfloop transitions, 8 changer transitions 13/700 dead transitions. [2024-11-10 14:36:45,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 700 transitions, 1507 flow [2024-11-10 14:36:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-11-10 14:36:45,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9591397849462365 [2024-11-10 14:36:45,286 INFO L175 Difference]: Start difference. First operand has 680 places, 701 transitions, 1458 flow. Second operand 3 states and 2230 transitions. [2024-11-10 14:36:45,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 700 transitions, 1507 flow [2024-11-10 14:36:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 700 transitions, 1501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:45,296 INFO L231 Difference]: Finished difference. Result has 675 places, 686 transitions, 1451 flow [2024-11-10 14:36:45,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=675, PETRI_TRANSITIONS=686} [2024-11-10 14:36:45,298 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -44 predicate places. [2024-11-10 14:36:45,298 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 686 transitions, 1451 flow [2024-11-10 14:36:45,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.6666666666666) internal successors, (2204), 3 states have internal predecessors, (2204), 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-10 14:36:45,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:36:45,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:36:45,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:45,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2015457070, now seen corresponding path program 1 times [2024-11-10 14:36:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:45,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801540602] [2024-11-10 14:36:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:45,332 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-10 14:36:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801540602] [2024-11-10 14:36:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801540602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816223943] [2024-11-10 14:36:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:45,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:45,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:45,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:36:45,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 686 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:36:45,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:45,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:36:45,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:45,558 INFO L124 PetriNetUnfolderBase]: 75/1469 cut-off events. [2024-11-10 14:36:45,559 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2024-11-10 14:36:45,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1469 events. 75/1469 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7616 event pairs, 10 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1420. Up to 67 conditions per place. [2024-11-10 14:36:45,573 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/686 dead transitions. [2024-11-10 14:36:45,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 686 transitions, 1492 flow [2024-11-10 14:36:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:36:45,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:36:45,578 INFO L175 Difference]: Start difference. First operand has 675 places, 686 transitions, 1451 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:36:45,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 686 transitions, 1492 flow [2024-11-10 14:36:45,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 686 transitions, 1484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:45,588 INFO L231 Difference]: Finished difference. Result has 663 places, 685 transitions, 1447 flow [2024-11-10 14:36:45,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=663, PETRI_TRANSITIONS=685} [2024-11-10 14:36:45,589 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -56 predicate places. [2024-11-10 14:36:45,589 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 685 transitions, 1447 flow [2024-11-10 14:36:45,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:36:45,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:45,590 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-10 14:36:45,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:36:45,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:45,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 750593969, now seen corresponding path program 1 times [2024-11-10 14:36:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758003549] [2024-11-10 14:36:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:45,628 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-10 14:36:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758003549] [2024-11-10 14:36:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758003549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:36:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709371327] [2024-11-10 14:36:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:45,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:45,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 775 [2024-11-10 14:36:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 685 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 746.3333333333334) internal successors, (2239), 3 states have internal predecessors, (2239), 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-10 14:36:45,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:45,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 775 [2024-11-10 14:36:45,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:46,570 INFO L124 PetriNetUnfolderBase]: 227/4869 cut-off events. [2024-11-10 14:36:46,570 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-10 14:36:46,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 4869 events. 227/4869 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41523 event pairs, 12 based on Foata normal form. 0/4092 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2024-11-10 14:36:46,658 INFO L140 encePairwiseOnDemand]: 767/775 looper letters, 17 selfloop transitions, 4 changer transitions 0/691 dead transitions. [2024-11-10 14:36:46,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 691 transitions, 1503 flow [2024-11-10 14:36:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2257 transitions. [2024-11-10 14:36:46,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.970752688172043 [2024-11-10 14:36:46,663 INFO L175 Difference]: Start difference. First operand has 663 places, 685 transitions, 1447 flow. Second operand 3 states and 2257 transitions. [2024-11-10 14:36:46,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 691 transitions, 1503 flow [2024-11-10 14:36:46,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 691 transitions, 1497 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:46,673 INFO L231 Difference]: Finished difference. Result has 665 places, 689 transitions, 1481 flow [2024-11-10 14:36:46,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=665, PETRI_TRANSITIONS=689} [2024-11-10 14:36:46,674 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -54 predicate places. [2024-11-10 14:36:46,675 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 689 transitions, 1481 flow [2024-11-10 14:36:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.3333333333334) internal successors, (2239), 3 states have internal predecessors, (2239), 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-10 14:36:46,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:46,675 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-10 14:36:46,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:36:46,676 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1753354222, now seen corresponding path program 1 times [2024-11-10 14:36:46,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371540488] [2024-11-10 14:36:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:46,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:46,713 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-10 14:36:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371540488] [2024-11-10 14:36:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371540488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64266842] [2024-11-10 14:36:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:46,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:46,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:46,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 775 [2024-11-10 14:36:46,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 689 transitions, 1481 flow. Second operand has 3 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 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-10 14:36:46,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:46,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 775 [2024-11-10 14:36:46,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:47,755 INFO L124 PetriNetUnfolderBase]: 317/6362 cut-off events. [2024-11-10 14:36:47,755 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-10 14:36:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 6362 events. 317/6362 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56142 event pairs, 15 based on Foata normal form. 0/5416 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2024-11-10 14:36:47,826 INFO L140 encePairwiseOnDemand]: 758/775 looper letters, 20 selfloop transitions, 9 changer transitions 0/686 dead transitions. [2024-11-10 14:36:47,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 686 transitions, 1534 flow [2024-11-10 14:36:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2024-11-10 14:36:47,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539784946236559 [2024-11-10 14:36:47,833 INFO L175 Difference]: Start difference. First operand has 665 places, 689 transitions, 1481 flow. Second operand 3 states and 2218 transitions. [2024-11-10 14:36:47,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 686 transitions, 1534 flow [2024-11-10 14:36:47,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 686 transitions, 1530 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:47,851 INFO L231 Difference]: Finished difference. Result has 660 places, 685 transitions, 1513 flow [2024-11-10 14:36:47,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=660, PETRI_TRANSITIONS=685} [2024-11-10 14:36:47,856 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:36:47,856 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 685 transitions, 1513 flow [2024-11-10 14:36:47,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 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-10 14:36:47,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:47,857 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:36:47,857 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1317160143, now seen corresponding path program 1 times [2024-11-10 14:36:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:47,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352392241] [2024-11-10 14:36:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:47,887 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-10 14:36:47,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:47,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352392241] [2024-11-10 14:36:47,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352392241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:47,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:47,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402167085] [2024-11-10 14:36:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:47,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:47,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:47,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 685 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-10 14:36:47,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:47,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:47,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:48,610 INFO L124 PetriNetUnfolderBase]: 298/6253 cut-off events. [2024-11-10 14:36:48,611 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-11-10 14:36:48,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 6253 events. 298/6253 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 60158 event pairs, 32 based on Foata normal form. 0/5302 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2024-11-10 14:36:48,702 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 21 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2024-11-10 14:36:48,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 685 transitions, 1562 flow [2024-11-10 14:36:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:36:48,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:36:48,706 INFO L175 Difference]: Start difference. First operand has 660 places, 685 transitions, 1513 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:36:48,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 685 transitions, 1562 flow [2024-11-10 14:36:48,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 685 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:48,714 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1499 flow [2024-11-10 14:36:48,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1499, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2024-11-10 14:36:48,715 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -60 predicate places. [2024-11-10 14:36:48,715 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1499 flow [2024-11-10 14:36:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-10 14:36:48,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:48,716 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] [2024-11-10 14:36:48,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:36:48,716 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -106947241, now seen corresponding path program 1 times [2024-11-10 14:36:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147035613] [2024-11-10 14:36:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:48,740 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-10 14:36:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147035613] [2024-11-10 14:36:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147035613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523385467] [2024-11-10 14:36:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:48,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 775 [2024-11-10 14:36:48,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 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-10 14:36:48,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:48,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 775 [2024-11-10 14:36:48,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:49,447 INFO L124 PetriNetUnfolderBase]: 318/5798 cut-off events. [2024-11-10 14:36:49,448 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2024-11-10 14:36:49,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 5798 events. 318/5798 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 55992 event pairs, 16 based on Foata normal form. 0/4978 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2024-11-10 14:36:49,533 INFO L140 encePairwiseOnDemand]: 758/775 looper letters, 20 selfloop transitions, 9 changer transitions 0/681 dead transitions. [2024-11-10 14:36:49,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 681 transitions, 1552 flow [2024-11-10 14:36:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2024-11-10 14:36:49,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539784946236559 [2024-11-10 14:36:49,537 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1499 flow. Second operand 3 states and 2218 transitions. [2024-11-10 14:36:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 681 transitions, 1552 flow [2024-11-10 14:36:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 681 transitions, 1546 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:49,543 INFO L231 Difference]: Finished difference. Result has 653 places, 680 transitions, 1529 flow [2024-11-10 14:36:49,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=653, PETRI_TRANSITIONS=680} [2024-11-10 14:36:49,544 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -66 predicate places. [2024-11-10 14:36:49,544 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 680 transitions, 1529 flow [2024-11-10 14:36:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 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-10 14:36:49,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:49,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:36:49,545 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash -517610085, now seen corresponding path program 1 times [2024-11-10 14:36:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071108505] [2024-11-10 14:36:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:49,569 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-10 14:36:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071108505] [2024-11-10 14:36:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071108505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:49,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601622693] [2024-11-10 14:36:49,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:49,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:49,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:49,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:36:49,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 680 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 741.3333333333334) internal successors, (2224), 3 states have internal predecessors, (2224), 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-10 14:36:49,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:49,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:36:49,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:50,405 INFO L124 PetriNetUnfolderBase]: 300/5768 cut-off events. [2024-11-10 14:36:50,406 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2024-11-10 14:36:50,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6682 conditions, 5768 events. 300/5768 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55148 event pairs, 35 based on Foata normal form. 0/4964 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2024-11-10 14:36:50,459 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 21 selfloop transitions, 3 changer transitions 0/680 dead transitions. [2024-11-10 14:36:50,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 680 transitions, 1578 flow [2024-11-10 14:36:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:36:50,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:36:50,466 INFO L175 Difference]: Start difference. First operand has 653 places, 680 transitions, 1529 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:36:50,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 680 transitions, 1578 flow [2024-11-10 14:36:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 680 transitions, 1560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:50,481 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1515 flow [2024-11-10 14:36:50,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2024-11-10 14:36:50,482 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -67 predicate places. [2024-11-10 14:36:50,482 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1515 flow [2024-11-10 14:36:50,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.3333333333334) internal successors, (2224), 3 states have internal predecessors, (2224), 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-10 14:36:50,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:50,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:50,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:36:50,483 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:50,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash -474172871, now seen corresponding path program 1 times [2024-11-10 14:36:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:50,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482895022] [2024-11-10 14:36:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:50,531 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-10 14:36:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482895022] [2024-11-10 14:36:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482895022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510219435] [2024-11-10 14:36:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:50,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:36:50,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1515 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-10 14:36:50,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:50,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:36:50,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:51,335 INFO L124 PetriNetUnfolderBase]: 263/5686 cut-off events. [2024-11-10 14:36:51,335 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:36:51,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 5686 events. 263/5686 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54306 event pairs, 9 based on Foata normal form. 0/4947 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2024-11-10 14:36:51,432 INFO L140 encePairwiseOnDemand]: 768/775 looper letters, 12 selfloop transitions, 3 changer transitions 0/676 dead transitions. [2024-11-10 14:36:51,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 676 transitions, 1540 flow [2024-11-10 14:36:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-10 14:36:51,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643010752688173 [2024-11-10 14:36:51,434 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1515 flow. Second operand 3 states and 2242 transitions. [2024-11-10 14:36:51,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 676 transitions, 1540 flow [2024-11-10 14:36:51,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 676 transitions, 1534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:51,442 INFO L231 Difference]: Finished difference. Result has 648 places, 675 transitions, 1507 flow [2024-11-10 14:36:51,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1507, PETRI_PLACES=648, PETRI_TRANSITIONS=675} [2024-11-10 14:36:51,443 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -71 predicate places. [2024-11-10 14:36:51,443 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 675 transitions, 1507 flow [2024-11-10 14:36:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-10 14:36:51,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:51,444 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] [2024-11-10 14:36:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:36:51,444 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1686347387, now seen corresponding path program 1 times [2024-11-10 14:36:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272020558] [2024-11-10 14:36:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:51,473 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-10 14:36:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272020558] [2024-11-10 14:36:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272020558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718445543] [2024-11-10 14:36:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:51,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:36:51,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 675 transitions, 1507 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:36:51,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:51,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:36:51,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:52,406 INFO L124 PetriNetUnfolderBase]: 291/5674 cut-off events. [2024-11-10 14:36:52,407 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-11-10 14:36:52,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6435 conditions, 5674 events. 291/5674 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 53480 event pairs, 12 based on Foata normal form. 0/4966 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2024-11-10 14:36:52,491 INFO L140 encePairwiseOnDemand]: 768/775 looper letters, 12 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-10 14:36:52,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 672 transitions, 1532 flow [2024-11-10 14:36:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-10 14:36:52,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643010752688173 [2024-11-10 14:36:52,494 INFO L175 Difference]: Start difference. First operand has 648 places, 675 transitions, 1507 flow. Second operand 3 states and 2242 transitions. [2024-11-10 14:36:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 672 transitions, 1532 flow [2024-11-10 14:36:52,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 672 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:52,504 INFO L231 Difference]: Finished difference. Result has 644 places, 671 transitions, 1499 flow [2024-11-10 14:36:52,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1499, PETRI_PLACES=644, PETRI_TRANSITIONS=671} [2024-11-10 14:36:52,506 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -75 predicate places. [2024-11-10 14:36:52,506 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 671 transitions, 1499 flow [2024-11-10 14:36:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:36:52,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:52,507 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] [2024-11-10 14:36:52,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:36:52,508 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:52,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1292039697, now seen corresponding path program 1 times [2024-11-10 14:36:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862902951] [2024-11-10 14:36:52,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:52,547 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-10 14:36:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862902951] [2024-11-10 14:36:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862902951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498290678] [2024-11-10 14:36:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:52,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 775 [2024-11-10 14:36:52,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 671 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:36:52,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:52,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 775 [2024-11-10 14:36:52,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:54,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,012 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-10 14:36:54,012 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 832#(= |#race~break_10~0| 0), 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,013 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-10 14:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:36:54,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,016 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-10 14:36:54,016 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,016 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-10 14:36:54,017 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 176#L55-13true, Black: 796#true]) [2024-11-10 14:36:54,024 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-10 14:36:54,024 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:36:54,024 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:36:54,024 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 830#true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,035 INFO L294 olderBase$Statistics]: this new event has 341 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,035 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:54,035 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,036 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 832#(= |#race~break_10~0| 0), 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,036 INFO L294 olderBase$Statistics]: this new event has 341 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,036 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,039 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:54,039 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,039 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,039 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:54,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,041 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:54,041 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,041 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,041 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:54,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 176#L55-13true, Black: 796#true]) [2024-11-10 14:36:54,046 INFO L294 olderBase$Statistics]: this new event has 341 ancestors and is cut-off event [2024-11-10 14:36:54,046 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,046 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,047 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 176#L55-13true, Black: 796#true]) [2024-11-10 14:36:54,048 INFO L294 olderBase$Statistics]: this new event has 341 ancestors and is cut-off event [2024-11-10 14:36:54,048 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,048 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:36:54,048 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:36:54,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 830#true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,063 INFO L294 olderBase$Statistics]: this new event has 344 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1653] L55-15-->L55-14: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,063 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:54,063 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:36:54,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:54,066 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-10 14:36:54,066 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:54,066 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:54,066 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:36:54,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 176#L55-13true, Black: 796#true]) [2024-11-10 14:36:54,073 INFO L294 olderBase$Statistics]: this new event has 344 ancestors and is cut-off event [2024-11-10 14:36:54,073 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-10 14:36:54,073 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:54,073 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-10 14:36:54,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2109] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][520], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 439#L110true, Black: 796#true]) [2024-11-10 14:36:54,118 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-10 14:36:54,118 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-10 14:36:54,118 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-10 14:36:54,118 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-10 14:36:54,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2109] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][520], [Black: 832#(= |#race~break_10~0| 0), 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 439#L110true, Black: 796#true]) [2024-11-10 14:36:54,119 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-10 14:36:54,119 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-10 14:36:54,119 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2024-11-10 14:36:54,119 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-10 14:36:54,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 439#L110true, Black: 796#true]) [2024-11-10 14:36:54,125 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-10 14:36:54,125 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-10 14:36:54,125 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-10 14:36:54,125 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-10 14:36:54,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2109] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][520], [Black: 830#true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 717#L76-13true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true, 439#L110true]) [2024-11-10 14:36:54,130 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-10 14:36:54,130 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2109] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][520], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true, 439#L110true]) [2024-11-10 14:36:54,131 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-10 14:36:54,131 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-10 14:36:54,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#true, 132#L76-14true, 843#(= |#race~i_8~0| 0), Black: 805#(= |#race~result_3~0| 0), 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, 439#L110true, Black: 796#true]) [2024-11-10 14:36:54,136 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-10 14:36:54,136 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-10 14:36:54,136 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:36:54,136 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:36:54,185 INFO L124 PetriNetUnfolderBase]: 565/10662 cut-off events. [2024-11-10 14:36:54,185 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-11-10 14:36:54,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11966 conditions, 10662 events. 565/10662 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 107672 event pairs, 22 based on Foata normal form. 0/9337 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2024-11-10 14:36:54,348 INFO L140 encePairwiseOnDemand]: 771/775 looper letters, 10 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-11-10 14:36:54,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 673 transitions, 1529 flow [2024-11-10 14:36:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2261 transitions. [2024-11-10 14:36:54,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724731182795698 [2024-11-10 14:36:54,350 INFO L175 Difference]: Start difference. First operand has 644 places, 671 transitions, 1499 flow. Second operand 3 states and 2261 transitions. [2024-11-10 14:36:54,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 673 transitions, 1529 flow [2024-11-10 14:36:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 673 transitions, 1523 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:54,359 INFO L231 Difference]: Finished difference. Result has 643 places, 671 transitions, 1503 flow [2024-11-10 14:36:54,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1503, PETRI_PLACES=643, PETRI_TRANSITIONS=671} [2024-11-10 14:36:54,360 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -76 predicate places. [2024-11-10 14:36:54,360 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 671 transitions, 1503 flow [2024-11-10 14:36:54,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:36:54,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:54,361 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] [2024-11-10 14:36:54,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:36:54,361 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1682704484, now seen corresponding path program 1 times [2024-11-10 14:36:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171309869] [2024-11-10 14:36:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:54,423 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-10 14:36:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171309869] [2024-11-10 14:36:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171309869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:36:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880298571] [2024-11-10 14:36:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:36:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:36:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:36:54,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 775 [2024-11-10 14:36:54,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 671 transitions, 1503 flow. Second operand has 4 states, 4 states have (on average 748.75) internal successors, (2995), 4 states have internal predecessors, (2995), 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-10 14:36:54,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:54,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 775 [2024-11-10 14:36:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:55,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,445 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:55,446 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:55,446 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:55,446 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:55,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 830#true, 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,468 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-10 14:36:55,468 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:55,468 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:55,468 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:36:55,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,731 INFO L294 olderBase$Statistics]: this new event has 430 ancestors and is cut-off event [2024-11-10 14:36:55,731 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2024-11-10 14:36:55,731 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-10 14:36:55,731 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2024-11-10 14:36:55,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,738 INFO L294 olderBase$Statistics]: this new event has 433 ancestors and is cut-off event [2024-11-10 14:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-10 14:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-10 14:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-10 14:36:55,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 830#true, 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,740 INFO L294 olderBase$Statistics]: this new event has 433 ancestors and is cut-off event [2024-11-10 14:36:55,740 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-10 14:36:55,740 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-10 14:36:55,740 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-10 14:36:55,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][509], [Black: 830#true, 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 822#true, Black: 792#true, Black: 796#true]) [2024-11-10 14:36:55,747 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2024-11-10 14:36:55,747 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2024-11-10 14:36:55,747 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2024-11-10 14:36:55,747 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-10 14:36:55,788 INFO L124 PetriNetUnfolderBase]: 463/10030 cut-off events. [2024-11-10 14:36:55,789 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 14:36:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11222 conditions, 10030 events. 463/10030 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 92511 event pairs, 26 based on Foata normal form. 0/8838 useless extension candidates. Maximal degree in co-relation 9796. Up to 159 conditions per place. [2024-11-10 14:36:55,960 INFO L140 encePairwiseOnDemand]: 767/775 looper letters, 13 selfloop transitions, 8 changer transitions 0/680 dead transitions. [2024-11-10 14:36:55,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 680 transitions, 1567 flow [2024-11-10 14:36:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:36:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:36:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3757 transitions. [2024-11-10 14:36:55,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9695483870967742 [2024-11-10 14:36:55,962 INFO L175 Difference]: Start difference. First operand has 643 places, 671 transitions, 1503 flow. Second operand 5 states and 3757 transitions. [2024-11-10 14:36:55,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 680 transitions, 1567 flow [2024-11-10 14:36:55,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 680 transitions, 1567 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:55,970 INFO L231 Difference]: Finished difference. Result has 650 places, 675 transitions, 1549 flow [2024-11-10 14:36:55,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1549, PETRI_PLACES=650, PETRI_TRANSITIONS=675} [2024-11-10 14:36:55,970 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -69 predicate places. [2024-11-10 14:36:55,971 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 675 transitions, 1549 flow [2024-11-10 14:36:55,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.75) internal successors, (2995), 4 states have internal predecessors, (2995), 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-10 14:36:55,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:55,971 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] [2024-11-10 14:36:55,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 14:36:55,972 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1231742581, now seen corresponding path program 1 times [2024-11-10 14:36:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44427852] [2024-11-10 14:36:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:55,997 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-10 14:36:55,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:55,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44427852] [2024-11-10 14:36:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44427852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:55,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:55,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946856107] [2024-11-10 14:36:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:55,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:56,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:36:56,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 675 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:36:56,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:56,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:36:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:57,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 667#L108-1true, 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, Black: 796#true]) [2024-11-10 14:36:57,518 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-10 14:36:57,519 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:57,519 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:36:57,519 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:36:57,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 830#true, 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 667#L108-1true, 794#(= |#race~name_1~0| 0), Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, Black: 796#true]) [2024-11-10 14:36:57,552 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-10 14:36:57,552 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:57,552 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:36:57,552 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:36:58,389 INFO L124 PetriNetUnfolderBase]: 882/19671 cut-off events. [2024-11-10 14:36:58,389 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-11-10 14:36:58,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22169 conditions, 19671 events. 882/19671 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 215974 event pairs, 87 based on Foata normal form. 0/17400 useless extension candidates. Maximal degree in co-relation 21083. Up to 460 conditions per place. [2024-11-10 14:36:58,584 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-11-10 14:36:58,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 675 transitions, 1590 flow [2024-11-10 14:36:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:36:58,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:36:58,586 INFO L175 Difference]: Start difference. First operand has 650 places, 675 transitions, 1549 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:36:58,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 675 transitions, 1590 flow [2024-11-10 14:36:58,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 675 transitions, 1590 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:58,596 INFO L231 Difference]: Finished difference. Result has 651 places, 674 transitions, 1553 flow [2024-11-10 14:36:58,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=651, PETRI_TRANSITIONS=674} [2024-11-10 14:36:58,597 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -68 predicate places. [2024-11-10 14:36:58,597 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 674 transitions, 1553 flow [2024-11-10 14:36:58,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:36:58,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:58,598 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] [2024-11-10 14:36:58,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:36:58,598 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:36:58,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2030978291, now seen corresponding path program 1 times [2024-11-10 14:36:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337328883] [2024-11-10 14:36:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:58,659 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-10 14:36:58,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:58,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337328883] [2024-11-10 14:36:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337328883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:58,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357696587] [2024-11-10 14:36:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:58,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:36:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:36:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:36:58,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 775 [2024-11-10 14:36:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 674 transitions, 1553 flow. Second operand has 5 states, 5 states have (on average 748.8) internal successors, (3744), 5 states have internal predecessors, (3744), 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-10 14:36:58,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:58,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 775 [2024-11-10 14:36:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:59,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,637 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-10 14:36:59,637 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-10 14:36:59,637 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-10 14:36:59,637 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-10 14:36:59,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 830#true, 132#L76-14true, 850#(= ~i_4~0 0), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,654 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-10 14:36:59,654 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2024-11-10 14:36:59,654 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-10 14:36:59,654 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2024-11-10 14:36:59,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,887 INFO L294 olderBase$Statistics]: this new event has 446 ancestors and is cut-off event [2024-11-10 14:36:59,887 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-10 14:36:59,887 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-10 14:36:59,887 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2024-11-10 14:36:59,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,894 INFO L294 olderBase$Statistics]: this new event has 449 ancestors and is cut-off event [2024-11-10 14:36:59,894 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:36:59,894 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-10 14:36:59,894 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:36:59,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 830#true, 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,895 INFO L294 olderBase$Statistics]: this new event has 449 ancestors and is cut-off event [2024-11-10 14:36:59,895 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-10 14:36:59,896 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:36:59,896 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:36:59,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 830#true, 132#L76-14true, Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 857#true, 860#true, Black: 796#true]) [2024-11-10 14:36:59,902 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is cut-off event [2024-11-10 14:36:59,902 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:36:59,903 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is cut-off event [2024-11-10 14:36:59,903 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:36:59,944 INFO L124 PetriNetUnfolderBase]: 399/8983 cut-off events. [2024-11-10 14:36:59,944 INFO L125 PetriNetUnfolderBase]: For 63/67 co-relation queries the response was YES. [2024-11-10 14:37:00,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 8983 events. 399/8983 cut-off events. For 63/67 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79837 event pairs, 14 based on Foata normal form. 1/7932 useless extension candidates. Maximal degree in co-relation 9866. Up to 159 conditions per place. [2024-11-10 14:37:00,123 INFO L140 encePairwiseOnDemand]: 768/775 looper letters, 7 selfloop transitions, 6 changer transitions 0/675 dead transitions. [2024-11-10 14:37:00,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 675 transitions, 1581 flow [2024-11-10 14:37:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:37:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:37:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3749 transitions. [2024-11-10 14:37:00,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9674838709677419 [2024-11-10 14:37:00,125 INFO L175 Difference]: Start difference. First operand has 651 places, 674 transitions, 1553 flow. Second operand 5 states and 3749 transitions. [2024-11-10 14:37:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 675 transitions, 1581 flow [2024-11-10 14:37:00,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 675 transitions, 1575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:00,133 INFO L231 Difference]: Finished difference. Result has 654 places, 675 transitions, 1567 flow [2024-11-10 14:37:00,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1567, PETRI_PLACES=654, PETRI_TRANSITIONS=675} [2024-11-10 14:37:00,134 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -65 predicate places. [2024-11-10 14:37:00,134 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 675 transitions, 1567 flow [2024-11-10 14:37:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 748.8) internal successors, (3744), 5 states have internal predecessors, (3744), 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-10 14:37:00,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:00,135 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:00,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:37:00,135 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:00,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1911625483, now seen corresponding path program 1 times [2024-11-10 14:37:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477562242] [2024-11-10 14:37:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477562242] [2024-11-10 14:37:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477562242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:37:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116975554] [2024-11-10 14:37:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:37:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:37:00,240 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-10 14:37:00,241 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-10 14:37:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:00,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 14:37:00,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:37:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:00,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:37:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116975554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:37:00,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:37:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-10 14:37:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279887240] [2024-11-10 14:37:00,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:37:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:37:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:37:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:37:00,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 775 [2024-11-10 14:37:00,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 675 transitions, 1567 flow. Second operand has 14 states, 14 states have (on average 746.0) internal successors, (10444), 14 states have internal predecessors, (10444), 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-10 14:37:00,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:00,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 775 [2024-11-10 14:37:00,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:01,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 850#(= ~i_4~0 0), Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:01,947 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2024-11-10 14:37:01,947 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:37:01,947 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:37:01,947 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:37:01,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 830#true, 132#L76-14true, 850#(= ~i_4~0 0), Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:01,965 INFO L294 olderBase$Statistics]: this new event has 391 ancestors and is cut-off event [2024-11-10 14:37:01,965 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:37:01,966 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:37:01,966 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:37:02,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:02,218 INFO L294 olderBase$Statistics]: this new event has 478 ancestors and is cut-off event [2024-11-10 14:37:02,218 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-10 14:37:02,218 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-10 14:37:02,218 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-10 14:37:02,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:02,225 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is cut-off event [2024-11-10 14:37:02,225 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:02,225 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:02,226 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-10 14:37:02,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 830#true, 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:02,227 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is cut-off event [2024-11-10 14:37:02,227 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:02,227 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-10 14:37:02,227 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:02,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 830#true, 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 792#true, 870#true, 860#true, Black: 796#true]) [2024-11-10 14:37:02,234 INFO L294 olderBase$Statistics]: this new event has 484 ancestors and is cut-off event [2024-11-10 14:37:02,234 INFO L297 olderBase$Statistics]: existing Event has 398 ancestors and is cut-off event [2024-11-10 14:37:02,234 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-10 14:37:02,234 INFO L297 olderBase$Statistics]: existing Event has 398 ancestors and is cut-off event [2024-11-10 14:37:02,276 INFO L124 PetriNetUnfolderBase]: 399/9002 cut-off events. [2024-11-10 14:37:02,277 INFO L125 PetriNetUnfolderBase]: For 47/51 co-relation queries the response was YES. [2024-11-10 14:37:02,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 9002 events. 399/9002 cut-off events. For 47/51 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79745 event pairs, 14 based on Foata normal form. 2/7952 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2024-11-10 14:37:02,415 INFO L140 encePairwiseOnDemand]: 765/775 looper letters, 11 selfloop transitions, 13 changer transitions 0/683 dead transitions. [2024-11-10 14:37:02,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 683 transitions, 1633 flow [2024-11-10 14:37:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:37:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:37:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8210 transitions. [2024-11-10 14:37:02,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.963049853372434 [2024-11-10 14:37:02,419 INFO L175 Difference]: Start difference. First operand has 654 places, 675 transitions, 1567 flow. Second operand 11 states and 8210 transitions. [2024-11-10 14:37:02,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 683 transitions, 1633 flow [2024-11-10 14:37:02,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 683 transitions, 1623 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:37:02,427 INFO L231 Difference]: Finished difference. Result has 664 places, 681 transitions, 1617 flow [2024-11-10 14:37:02,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1617, PETRI_PLACES=664, PETRI_TRANSITIONS=681} [2024-11-10 14:37:02,428 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -55 predicate places. [2024-11-10 14:37:02,428 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 681 transitions, 1617 flow [2024-11-10 14:37:02,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 746.0) internal successors, (10444), 14 states have internal predecessors, (10444), 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-10 14:37:02,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:02,430 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 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-10 14:37:02,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:37:02,634 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,SelfDestructingSolverStorable33 [2024-11-10 14:37:02,635 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:02,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 70331195, now seen corresponding path program 2 times [2024-11-10 14:37:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921766091] [2024-11-10 14:37:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921766091] [2024-11-10 14:37:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921766091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:37:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651682159] [2024-11-10 14:37:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:37:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:37:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:37:03,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 775 [2024-11-10 14:37:03,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 681 transitions, 1617 flow. Second operand has 6 states, 6 states have (on average 742.5) internal successors, (4455), 6 states have internal predecessors, (4455), 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-10 14:37:03,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:03,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 775 [2024-11-10 14:37:03,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:04,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, 850#(= ~i_4~0 0), Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,317 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2024-11-10 14:37:04,317 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:37:04,317 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:37:04,317 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:37:04,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 830#true, 132#L76-14true, 850#(= ~i_4~0 0), Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 848#true, Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,337 INFO L294 olderBase$Statistics]: this new event has 391 ancestors and is cut-off event [2024-11-10 14:37:04,337 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:37:04,337 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:37:04,337 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:37:04,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,594 INFO L294 olderBase$Statistics]: this new event has 478 ancestors and is cut-off event [2024-11-10 14:37:04,594 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-10 14:37:04,594 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-10 14:37:04,595 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-10 14:37:04,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 832#(= |#race~break_10~0| 0), 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,602 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is cut-off event [2024-11-10 14:37:04,602 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:04,602 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-10 14:37:04,602 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:04,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 830#true, 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, 819#(= ~name_2~0 ~name_1~0), Black: 812#(= |#race~result_7~0| 0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 824#(= |#race~break_6~0| 0), Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,603 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is cut-off event [2024-11-10 14:37:04,603 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:04,603 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-10 14:37:04,603 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:37:04,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1930] L76-15-->L76-14: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][516], [Black: 830#true, 132#L76-14true, Black: 868#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 805#(= |#race~result_3~0| 0), 50#L55-14true, Black: 812#(= |#race~result_7~0| 0), 819#(= ~name_2~0 ~name_1~0), 798#(= |#race~name_2~0| 0), Black: 844#true, 848#true, 794#(= |#race~name_1~0| 0), 667#L108-1true, Black: 817#true, 846#(= |#race~nondet_0~0| 0), Black: 850#(= ~i_4~0 0), Black: 853#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 822#true, Black: 2187#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 792#true, Black: 2201#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2195#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2205#true, 870#true, Black: 796#true]) [2024-11-10 14:37:04,611 INFO L294 olderBase$Statistics]: this new event has 484 ancestors and is cut-off event [2024-11-10 14:37:04,611 INFO L297 olderBase$Statistics]: existing Event has 398 ancestors and is cut-off event [2024-11-10 14:37:04,611 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-10 14:37:04,611 INFO L297 olderBase$Statistics]: existing Event has 398 ancestors and is cut-off event [2024-11-10 14:37:04,656 INFO L124 PetriNetUnfolderBase]: 473/10034 cut-off events. [2024-11-10 14:37:04,656 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-10 14:37:04,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11450 conditions, 10034 events. 473/10034 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 92097 event pairs, 17 based on Foata normal form. 0/8890 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2024-11-10 14:37:04,812 INFO L140 encePairwiseOnDemand]: 769/775 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2024-11-10 14:37:04,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 684 transitions, 1673 flow [2024-11-10 14:37:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:37:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:37:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4463 transitions. [2024-11-10 14:37:04,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597849462365592 [2024-11-10 14:37:04,815 INFO L175 Difference]: Start difference. First operand has 664 places, 681 transitions, 1617 flow. Second operand 6 states and 4463 transitions. [2024-11-10 14:37:04,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 684 transitions, 1673 flow [2024-11-10 14:37:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 684 transitions, 1661 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-10 14:37:04,824 INFO L231 Difference]: Finished difference. Result has 665 places, 680 transitions, 1615 flow [2024-11-10 14:37:04,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1615, PETRI_PLACES=665, PETRI_TRANSITIONS=680} [2024-11-10 14:37:04,825 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -54 predicate places. [2024-11-10 14:37:04,825 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 680 transitions, 1615 flow [2024-11-10 14:37:04,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 742.5) internal successors, (4455), 6 states have internal predecessors, (4455), 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-10 14:37:04,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:04,826 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 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-10 14:37:04,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 14:37:04,827 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:04,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1390345981, now seen corresponding path program 1 times [2024-11-10 14:37:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:04,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033116130] [2024-11-10 14:37:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:04,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033116130] [2024-11-10 14:37:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033116130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:37:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604747037] [2024-11-10 14:37:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:04,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:37:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:37:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:37:04,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 775 [2024-11-10 14:37:04,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 680 transitions, 1615 flow. Second operand has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 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-10 14:37:04,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:04,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 775 [2024-11-10 14:37:04,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:07,648 INFO L124 PetriNetUnfolderBase]: 649/12852 cut-off events. [2024-11-10 14:37:07,648 INFO L125 PetriNetUnfolderBase]: For 140/144 co-relation queries the response was YES. [2024-11-10 14:37:07,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14640 conditions, 12852 events. 649/12852 cut-off events. For 140/144 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 126533 event pairs, 42 based on Foata normal form. 0/11323 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2024-11-10 14:37:07,857 INFO L140 encePairwiseOnDemand]: 767/775 looper letters, 12 selfloop transitions, 8 changer transitions 0/688 dead transitions. [2024-11-10 14:37:07,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 688 transitions, 1674 flow [2024-11-10 14:37:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:37:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:37:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3756 transitions. [2024-11-10 14:37:07,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9692903225806452 [2024-11-10 14:37:07,861 INFO L175 Difference]: Start difference. First operand has 665 places, 680 transitions, 1615 flow. Second operand 5 states and 3756 transitions. [2024-11-10 14:37:07,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 688 transitions, 1674 flow [2024-11-10 14:37:07,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 688 transitions, 1662 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:37:07,874 INFO L231 Difference]: Finished difference. Result has 667 places, 684 transitions, 1649 flow [2024-11-10 14:37:07,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1649, PETRI_PLACES=667, PETRI_TRANSITIONS=684} [2024-11-10 14:37:07,875 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -52 predicate places. [2024-11-10 14:37:07,875 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 684 transitions, 1649 flow [2024-11-10 14:37:07,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 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-10 14:37:07,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:07,876 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 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-10 14:37:07,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 14:37:07,876 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:07,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 9825750, now seen corresponding path program 1 times [2024-11-10 14:37:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18125105] [2024-11-10 14:37:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18125105] [2024-11-10 14:37:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18125105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867324852] [2024-11-10 14:37:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:07,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:07,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:37:07,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 684 transitions, 1649 flow. Second operand has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:07,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:07,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:37:07,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:10,943 INFO L124 PetriNetUnfolderBase]: 731/12846 cut-off events. [2024-11-10 14:37:10,943 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2024-11-10 14:37:11,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15205 conditions, 12846 events. 731/12846 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 129704 event pairs, 103 based on Foata normal form. 0/11333 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2024-11-10 14:37:11,066 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 16 selfloop transitions, 3 changer transitions 1/684 dead transitions. [2024-11-10 14:37:11,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 684 transitions, 1690 flow [2024-11-10 14:37:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:37:11,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:37:11,068 INFO L175 Difference]: Start difference. First operand has 667 places, 684 transitions, 1649 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:37:11,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 684 transitions, 1690 flow [2024-11-10 14:37:11,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1690 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:11,076 INFO L231 Difference]: Finished difference. Result has 668 places, 683 transitions, 1653 flow [2024-11-10 14:37:11,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=683} [2024-11-10 14:37:11,077 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -51 predicate places. [2024-11-10 14:37:11,077 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 683 transitions, 1653 flow [2024-11-10 14:37:11,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:11,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:11,077 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 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-10 14:37:11,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 14:37:11,078 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:11,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash -403775295, now seen corresponding path program 1 times [2024-11-10 14:37:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725504845] [2024-11-10 14:37:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725504845] [2024-11-10 14:37:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725504845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647220733] [2024-11-10 14:37:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:11,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:11,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 775 [2024-11-10 14:37:11,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 683 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 747.6666666666666) internal successors, (2243), 3 states have internal predecessors, (2243), 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-10 14:37:11,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:11,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 775 [2024-11-10 14:37:11,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:13,377 INFO L124 PetriNetUnfolderBase]: 567/11730 cut-off events. [2024-11-10 14:37:13,377 INFO L125 PetriNetUnfolderBase]: For 167/169 co-relation queries the response was YES. [2024-11-10 14:37:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13553 conditions, 11730 events. 567/11730 cut-off events. For 167/169 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110236 event pairs, 52 based on Foata normal form. 0/10412 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2024-11-10 14:37:13,630 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 11 selfloop transitions, 2 changer transitions 0/683 dead transitions. [2024-11-10 14:37:13,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 683 transitions, 1680 flow [2024-11-10 14:37:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2024-11-10 14:37:13,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9686021505376344 [2024-11-10 14:37:13,632 INFO L175 Difference]: Start difference. First operand has 668 places, 683 transitions, 1653 flow. Second operand 3 states and 2252 transitions. [2024-11-10 14:37:13,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 683 transitions, 1680 flow [2024-11-10 14:37:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:13,642 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1649 flow [2024-11-10 14:37:13,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2024-11-10 14:37:13,643 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -52 predicate places. [2024-11-10 14:37:13,643 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1649 flow [2024-11-10 14:37:13,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.6666666666666) internal successors, (2243), 3 states have internal predecessors, (2243), 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-10 14:37:13,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:13,644 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 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-10 14:37:13,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 14:37:13,644 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:13,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash -245225369, now seen corresponding path program 1 times [2024-11-10 14:37:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746155585] [2024-11-10 14:37:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746155585] [2024-11-10 14:37:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746155585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:37:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419427222] [2024-11-10 14:37:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:37:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:37:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:37:14,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 775 [2024-11-10 14:37:14,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1649 flow. Second operand has 6 states, 6 states have (on average 742.6666666666666) internal successors, (4456), 6 states have internal predecessors, (4456), 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-10 14:37:14,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:14,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 775 [2024-11-10 14:37:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:16,251 INFO L124 PetriNetUnfolderBase]: 670/12761 cut-off events. [2024-11-10 14:37:16,252 INFO L125 PetriNetUnfolderBase]: For 293/297 co-relation queries the response was YES. [2024-11-10 14:37:16,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14907 conditions, 12761 events. 670/12761 cut-off events. For 293/297 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 127191 event pairs, 30 based on Foata normal form. 0/11369 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2024-11-10 14:37:16,471 INFO L140 encePairwiseOnDemand]: 769/775 looper letters, 17 selfloop transitions, 6 changer transitions 0/685 dead transitions. [2024-11-10 14:37:16,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 685 transitions, 1705 flow [2024-11-10 14:37:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:37:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:37:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4463 transitions. [2024-11-10 14:37:16,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597849462365592 [2024-11-10 14:37:16,474 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1649 flow. Second operand 6 states and 4463 transitions. [2024-11-10 14:37:16,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 685 transitions, 1705 flow [2024-11-10 14:37:16,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 685 transitions, 1701 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:16,482 INFO L231 Difference]: Finished difference. Result has 669 places, 681 transitions, 1655 flow [2024-11-10 14:37:16,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1655, PETRI_PLACES=669, PETRI_TRANSITIONS=681} [2024-11-10 14:37:16,483 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -50 predicate places. [2024-11-10 14:37:16,483 INFO L471 AbstractCegarLoop]: Abstraction has has 669 places, 681 transitions, 1655 flow [2024-11-10 14:37:16,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 742.6666666666666) internal successors, (4456), 6 states have internal predecessors, (4456), 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-10 14:37:16,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:16,484 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:16,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 14:37:16,484 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:16,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1557103995, now seen corresponding path program 1 times [2024-11-10 14:37:16,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621188874] [2024-11-10 14:37:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621188874] [2024-11-10 14:37:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621188874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784900319] [2024-11-10 14:37:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:16,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 775 [2024-11-10 14:37:16,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 681 transitions, 1655 flow. Second operand has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:16,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:16,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 775 [2024-11-10 14:37:16,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:18,735 INFO L124 PetriNetUnfolderBase]: 653/13676 cut-off events. [2024-11-10 14:37:18,736 INFO L125 PetriNetUnfolderBase]: For 193/195 co-relation queries the response was YES. [2024-11-10 14:37:18,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15991 conditions, 13676 events. 653/13676 cut-off events. For 193/195 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 130493 event pairs, 26 based on Foata normal form. 0/12252 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2024-11-10 14:37:18,886 INFO L140 encePairwiseOnDemand]: 769/775 looper letters, 14 selfloop transitions, 2 changer transitions 0/680 dead transitions. [2024-11-10 14:37:18,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 680 transitions, 1687 flow [2024-11-10 14:37:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2246 transitions. [2024-11-10 14:37:18,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9660215053763441 [2024-11-10 14:37:18,888 INFO L175 Difference]: Start difference. First operand has 669 places, 681 transitions, 1655 flow. Second operand 3 states and 2246 transitions. [2024-11-10 14:37:18,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 680 transitions, 1687 flow [2024-11-10 14:37:18,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 680 transitions, 1675 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:37:18,897 INFO L231 Difference]: Finished difference. Result has 663 places, 678 transitions, 1645 flow [2024-11-10 14:37:18,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=663, PETRI_TRANSITIONS=678} [2024-11-10 14:37:18,898 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -56 predicate places. [2024-11-10 14:37:18,898 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 678 transitions, 1645 flow [2024-11-10 14:37:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:18,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:18,898 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:18,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 14:37:18,898 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1387821779, now seen corresponding path program 1 times [2024-11-10 14:37:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64224587] [2024-11-10 14:37:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64224587] [2024-11-10 14:37:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64224587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894161840] [2024-11-10 14:37:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:18,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 775 [2024-11-10 14:37:18,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 678 transitions, 1645 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-10 14:37:18,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:18,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 775 [2024-11-10 14:37:18,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:20,888 INFO L124 PetriNetUnfolderBase]: 687/12106 cut-off events. [2024-11-10 14:37:20,889 INFO L125 PetriNetUnfolderBase]: For 257/261 co-relation queries the response was YES. [2024-11-10 14:37:21,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14280 conditions, 12106 events. 687/12106 cut-off events. For 257/261 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 120346 event pairs, 82 based on Foata normal form. 0/10850 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2024-11-10 14:37:21,103 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 11 selfloop transitions, 2 changer transitions 0/678 dead transitions. [2024-11-10 14:37:21,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 678 transitions, 1672 flow [2024-11-10 14:37:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2024-11-10 14:37:21,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9686021505376344 [2024-11-10 14:37:21,105 INFO L175 Difference]: Start difference. First operand has 663 places, 678 transitions, 1645 flow. Second operand 3 states and 2252 transitions. [2024-11-10 14:37:21,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 678 transitions, 1672 flow [2024-11-10 14:37:21,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 678 transitions, 1670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:21,114 INFO L231 Difference]: Finished difference. Result has 663 places, 677 transitions, 1645 flow [2024-11-10 14:37:21,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=663, PETRI_TRANSITIONS=677} [2024-11-10 14:37:21,115 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -56 predicate places. [2024-11-10 14:37:21,115 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 677 transitions, 1645 flow [2024-11-10 14:37:21,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-10 14:37:21,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:21,115 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:21,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 14:37:21,116 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 168502833, now seen corresponding path program 1 times [2024-11-10 14:37:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310209629] [2024-11-10 14:37:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310209629] [2024-11-10 14:37:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310209629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:21,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:21,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622393887] [2024-11-10 14:37:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:21,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:21,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 775 [2024-11-10 14:37:21,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 677 transitions, 1645 flow. Second operand has 3 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 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-10 14:37:21,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:21,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 775 [2024-11-10 14:37:21,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:23,096 INFO L124 PetriNetUnfolderBase]: 693/11899 cut-off events. [2024-11-10 14:37:23,096 INFO L125 PetriNetUnfolderBase]: For 307/311 co-relation queries the response was YES. [2024-11-10 14:37:23,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14206 conditions, 11899 events. 693/11899 cut-off events. For 307/311 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 118728 event pairs, 30 based on Foata normal form. 0/10844 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2024-11-10 14:37:23,301 INFO L140 encePairwiseOnDemand]: 769/775 looper letters, 13 selfloop transitions, 2 changer transitions 0/675 dead transitions. [2024-11-10 14:37:23,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1674 flow [2024-11-10 14:37:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2245 transitions. [2024-11-10 14:37:23,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655913978494624 [2024-11-10 14:37:23,303 INFO L175 Difference]: Start difference. First operand has 663 places, 677 transitions, 1645 flow. Second operand 3 states and 2245 transitions. [2024-11-10 14:37:23,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1674 flow [2024-11-10 14:37:23,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1668 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:23,316 INFO L231 Difference]: Finished difference. Result has 660 places, 674 transitions, 1643 flow [2024-11-10 14:37:23,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=660, PETRI_TRANSITIONS=674} [2024-11-10 14:37:23,317 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:37:23,317 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 674 transitions, 1643 flow [2024-11-10 14:37:23,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 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-10 14:37:23,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:23,317 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:23,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 14:37:23,317 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1860813521, now seen corresponding path program 1 times [2024-11-10 14:37:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260578105] [2024-11-10 14:37:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260578105] [2024-11-10 14:37:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260578105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108786232] [2024-11-10 14:37:23,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:23,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:23,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:37:23,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 674 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:37:23,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:23,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:37:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:26,078 INFO L124 PetriNetUnfolderBase]: 825/17132 cut-off events. [2024-11-10 14:37:26,079 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2024-11-10 14:37:26,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20021 conditions, 17132 events. 825/17132 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 177827 event pairs, 75 based on Foata normal form. 0/15691 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2024-11-10 14:37:26,262 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2024-11-10 14:37:26,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 674 transitions, 1684 flow [2024-11-10 14:37:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:37:26,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:37:26,264 INFO L175 Difference]: Start difference. First operand has 660 places, 674 transitions, 1643 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:37:26,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 674 transitions, 1684 flow [2024-11-10 14:37:26,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1682 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:26,273 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1645 flow [2024-11-10 14:37:26,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-11-10 14:37:26,274 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:37:26,274 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1645 flow [2024-11-10 14:37:26,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:37:26,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:26,274 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:26,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 14:37:26,275 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1008180477, now seen corresponding path program 1 times [2024-11-10 14:37:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28957649] [2024-11-10 14:37:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:26,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28957649] [2024-11-10 14:37:26,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28957649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:26,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:26,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282745191] [2024-11-10 14:37:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:26,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:26,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:37:26,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1645 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:37:26,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:26,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:37:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:28,549 INFO L124 PetriNetUnfolderBase]: 747/12386 cut-off events. [2024-11-10 14:37:28,549 INFO L125 PetriNetUnfolderBase]: For 635/639 co-relation queries the response was YES. [2024-11-10 14:37:28,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15079 conditions, 12386 events. 747/12386 cut-off events. For 635/639 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 124163 event pairs, 110 based on Foata normal form. 0/11353 useless extension candidates. Maximal degree in co-relation 14851. Up to 645 conditions per place. [2024-11-10 14:37:28,683 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-10 14:37:28,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1686 flow [2024-11-10 14:37:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:37:28,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:37:28,686 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1645 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:37:28,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1686 flow [2024-11-10 14:37:28,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:28,699 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2024-11-10 14:37:28,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-11-10 14:37:28,699 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -60 predicate places. [2024-11-10 14:37:28,699 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2024-11-10 14:37:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:37:28,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:28,700 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 14:37:28,700 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1991594427, now seen corresponding path program 1 times [2024-11-10 14:37:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:28,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620502084] [2024-11-10 14:37:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620502084] [2024-11-10 14:37:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620502084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845856539] [2024-11-10 14:37:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:28,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:28,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:28,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:37:28,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-10 14:37:28,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:28,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:37:28,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:32,616 INFO L124 PetriNetUnfolderBase]: 871/18318 cut-off events. [2024-11-10 14:37:32,616 INFO L125 PetriNetUnfolderBase]: For 467/469 co-relation queries the response was YES. [2024-11-10 14:37:32,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21611 conditions, 18318 events. 871/18318 cut-off events. For 467/469 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 191591 event pairs, 66 based on Foata normal form. 0/16869 useless extension candidates. Maximal degree in co-relation 21383. Up to 451 conditions per place. [2024-11-10 14:37:32,937 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 21 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-10 14:37:32,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1692 flow [2024-11-10 14:37:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:37:32,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:37:32,939 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:37:32,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1692 flow [2024-11-10 14:37:32,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1686 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:32,953 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2024-11-10 14:37:32,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-11-10 14:37:32,954 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -61 predicate places. [2024-11-10 14:37:32,954 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2024-11-10 14:37:32,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-10 14:37:32,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:32,955 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:32,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 14:37:32,955 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:32,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 919978407, now seen corresponding path program 1 times [2024-11-10 14:37:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:32,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285454636] [2024-11-10 14:37:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:32,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285454636] [2024-11-10 14:37:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285454636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:33,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:33,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528830887] [2024-11-10 14:37:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:33,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:33,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:33,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:37:33,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-10 14:37:33,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:33,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:37:33,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:35,261 INFO L124 PetriNetUnfolderBase]: 743/12366 cut-off events. [2024-11-10 14:37:35,261 INFO L125 PetriNetUnfolderBase]: For 564/568 co-relation queries the response was YES. [2024-11-10 14:37:35,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14955 conditions, 12366 events. 743/12366 cut-off events. For 564/568 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 125039 event pairs, 118 based on Foata normal form. 0/11376 useless extension candidates. Maximal degree in co-relation 14727. Up to 648 conditions per place. [2024-11-10 14:37:35,500 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-11-10 14:37:35,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2024-11-10 14:37:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:37:35,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:37:35,502 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:37:35,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2024-11-10 14:37:35,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:35,510 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2024-11-10 14:37:35,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2024-11-10 14:37:35,511 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -62 predicate places. [2024-11-10 14:37:35,511 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2024-11-10 14:37:35,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-10 14:37:35,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:35,512 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:35,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 14:37:35,512 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1602578761, now seen corresponding path program 1 times [2024-11-10 14:37:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596895535] [2024-11-10 14:37:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596895535] [2024-11-10 14:37:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596895535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374621130] [2024-11-10 14:37:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:35,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:35,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:35,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 775 [2024-11-10 14:37:35,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:37:35,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:35,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 775 [2024-11-10 14:37:35,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:37,938 INFO L124 PetriNetUnfolderBase]: 557/11434 cut-off events. [2024-11-10 14:37:37,939 INFO L125 PetriNetUnfolderBase]: For 153/155 co-relation queries the response was YES. [2024-11-10 14:37:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 11434 events. 557/11434 cut-off events. For 153/155 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102758 event pairs, 40 based on Foata normal form. 0/10549 useless extension candidates. Maximal degree in co-relation 13179. Up to 205 conditions per place. [2024-11-10 14:37:38,190 INFO L140 encePairwiseOnDemand]: 771/775 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-10 14:37:38,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1672 flow [2024-11-10 14:37:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2261 transitions. [2024-11-10 14:37:38,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724731182795698 [2024-11-10 14:37:38,192 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2261 transitions. [2024-11-10 14:37:38,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1672 flow [2024-11-10 14:37:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:38,201 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1655 flow [2024-11-10 14:37:38,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1655, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-11-10 14:37:38,202 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -60 predicate places. [2024-11-10 14:37:38,202 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1655 flow [2024-11-10 14:37:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:37:38,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:38,202 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-10 14:37:38,202 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 844610638, now seen corresponding path program 1 times [2024-11-10 14:37:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362102641] [2024-11-10 14:37:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362102641] [2024-11-10 14:37:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362102641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137548919] [2024-11-10 14:37:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:38,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:37:38,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1655 flow. Second operand has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:38,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:38,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:37:38,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,792 INFO L124 PetriNetUnfolderBase]: 911/19057 cut-off events. [2024-11-10 14:37:41,792 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2024-11-10 14:37:42,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22441 conditions, 19057 events. 911/19057 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 198064 event pairs, 71 based on Foata normal form. 0/17659 useless extension candidates. Maximal degree in co-relation 22212. Up to 430 conditions per place. [2024-11-10 14:37:42,180 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-10 14:37:42,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1696 flow [2024-11-10 14:37:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:37:42,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:37:42,182 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1655 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:37:42,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1696 flow [2024-11-10 14:37:42,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,194 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2024-11-10 14:37:42,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-11-10 14:37:42,195 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -61 predicate places. [2024-11-10 14:37:42,195 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2024-11-10 14:37:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 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-10 14:37:42,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,196 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:42,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-10 14:37:42,196 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:42,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1554370293, now seen corresponding path program 1 times [2024-11-10 14:37:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97839856] [2024-11-10 14:37:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97839856] [2024-11-10 14:37:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97839856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101389007] [2024-11-10 14:37:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 775 [2024-11-10 14:37:42,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 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-10 14:37:42,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 775 [2024-11-10 14:37:42,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,389 INFO L124 PetriNetUnfolderBase]: 631/11744 cut-off events. [2024-11-10 14:37:44,390 INFO L125 PetriNetUnfolderBase]: For 215/219 co-relation queries the response was YES. [2024-11-10 14:37:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13975 conditions, 11744 events. 631/11744 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 114389 event pairs, 59 based on Foata normal form. 0/10823 useless extension candidates. Maximal degree in co-relation 13747. Up to 317 conditions per place. [2024-11-10 14:37:44,542 INFO L140 encePairwiseOnDemand]: 771/775 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2024-11-10 14:37:44,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1686 flow [2024-11-10 14:37:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2261 transitions. [2024-11-10 14:37:44,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724731182795698 [2024-11-10 14:37:44,544 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2261 transitions. [2024-11-10 14:37:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1686 flow [2024-11-10 14:37:44,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,551 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1669 flow [2024-11-10 14:37:44,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1669, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-11-10 14:37:44,556 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:37:44,556 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1669 flow [2024-11-10 14:37:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 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-10 14:37:44,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,556 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:44,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-10 14:37:44,556 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:44,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1760922010, now seen corresponding path program 1 times [2024-11-10 14:37:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103514722] [2024-11-10 14:37:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103514722] [2024-11-10 14:37:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103514722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506744470] [2024-11-10 14:37:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 775 [2024-11-10 14:37:44,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1669 flow. Second operand has 3 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 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-10 14:37:44,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 775 [2024-11-10 14:37:44,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:46,708 INFO L124 PetriNetUnfolderBase]: 747/12438 cut-off events. [2024-11-10 14:37:46,709 INFO L125 PetriNetUnfolderBase]: For 760/764 co-relation queries the response was YES. [2024-11-10 14:37:46,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15472 conditions, 12438 events. 747/12438 cut-off events. For 760/764 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 126050 event pairs, 102 based on Foata normal form. 0/11600 useless extension candidates. Maximal degree in co-relation 15242. Up to 613 conditions per place. [2024-11-10 14:37:46,923 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-10 14:37:46,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1710 flow [2024-11-10 14:37:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-10 14:37:46,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634408602150538 [2024-11-10 14:37:46,925 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1669 flow. Second operand 3 states and 2240 transitions. [2024-11-10 14:37:46,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1710 flow [2024-11-10 14:37:46,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1704 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:46,936 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2024-11-10 14:37:46,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-11-10 14:37:46,936 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -60 predicate places. [2024-11-10 14:37:46,937 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2024-11-10 14:37:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 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-10 14:37:46,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:46,937 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-10 14:37:46,937 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:46,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1771804123, now seen corresponding path program 1 times [2024-11-10 14:37:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025303751] [2024-11-10 14:37:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025303751] [2024-11-10 14:37:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025303751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700995587] [2024-11-10 14:37:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:46,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 775 [2024-11-10 14:37:46,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:37:46,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:46,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 775 [2024-11-10 14:37:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:48,795 INFO L124 PetriNetUnfolderBase]: 557/11580 cut-off events. [2024-11-10 14:37:48,795 INFO L125 PetriNetUnfolderBase]: For 167/169 co-relation queries the response was YES. [2024-11-10 14:37:48,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13862 conditions, 11580 events. 557/11580 cut-off events. For 167/169 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 103408 event pairs, 40 based on Foata normal form. 0/10786 useless extension candidates. Maximal degree in co-relation 13633. Up to 205 conditions per place. [2024-11-10 14:37:48,986 INFO L140 encePairwiseOnDemand]: 771/775 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-11-10 14:37:48,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1700 flow [2024-11-10 14:37:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2261 transitions. [2024-11-10 14:37:48,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724731182795698 [2024-11-10 14:37:48,988 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2261 transitions. [2024-11-10 14:37:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1700 flow [2024-11-10 14:37:48,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:48,997 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1683 flow [2024-11-10 14:37:48,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1683, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2024-11-10 14:37:48,997 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -58 predicate places. [2024-11-10 14:37:48,997 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1683 flow [2024-11-10 14:37:48,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 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-10 14:37:48,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:48,998 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-10 14:37:48,998 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:48,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 261427168, now seen corresponding path program 1 times [2024-11-10 14:37:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168990518] [2024-11-10 14:37:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168990518] [2024-11-10 14:37:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168990518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332859625] [2024-11-10 14:37:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:49,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:49,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:49,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:37:49,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1683 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:37:49,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:49,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:37:49,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:52,819 INFO L124 PetriNetUnfolderBase]: 1079/23276 cut-off events. [2024-11-10 14:37:52,820 INFO L125 PetriNetUnfolderBase]: For 437/439 co-relation queries the response was YES. [2024-11-10 14:37:52,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27825 conditions, 23276 events. 1079/23276 cut-off events. For 437/439 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 253727 event pairs, 68 based on Foata normal form. 0/21769 useless extension candidates. Maximal degree in co-relation 27594. Up to 565 conditions per place. [2024-11-10 14:37:53,027 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 22 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-11-10 14:37:53,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1732 flow [2024-11-10 14:37:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:37:53,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:37:53,029 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1683 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:37:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1732 flow [2024-11-10 14:37:53,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:53,039 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1679 flow [2024-11-10 14:37:53,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1679, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-11-10 14:37:53,040 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:37:53,040 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1679 flow [2024-11-10 14:37:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-10 14:37:53,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,041 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:53,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-10 14:37:53,041 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 311772516, now seen corresponding path program 1 times [2024-11-10 14:37:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71063803] [2024-11-10 14:37:53,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71063803] [2024-11-10 14:37:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71063803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950277740] [2024-11-10 14:37:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 775 [2024-11-10 14:37:53,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 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-10 14:37:53,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 775 [2024-11-10 14:37:53,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,067 INFO L124 PetriNetUnfolderBase]: 623/11888 cut-off events. [2024-11-10 14:37:55,067 INFO L125 PetriNetUnfolderBase]: For 215/219 co-relation queries the response was YES. [2024-11-10 14:37:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14449 conditions, 11888 events. 623/11888 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 115242 event pairs, 59 based on Foata normal form. 0/11078 useless extension candidates. Maximal degree in co-relation 14219. Up to 317 conditions per place. [2024-11-10 14:37:55,285 INFO L140 encePairwiseOnDemand]: 771/775 looper letters, 10 selfloop transitions, 3 changer transitions 0/676 dead transitions. [2024-11-10 14:37:55,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 676 transitions, 1712 flow [2024-11-10 14:37:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2261 transitions. [2024-11-10 14:37:55,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724731182795698 [2024-11-10 14:37:55,287 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1679 flow. Second operand 3 states and 2261 transitions. [2024-11-10 14:37:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 676 transitions, 1712 flow [2024-11-10 14:37:55,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 676 transitions, 1708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:55,296 INFO L231 Difference]: Finished difference. Result has 662 places, 675 transitions, 1697 flow [2024-11-10 14:37:55,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1697, PETRI_PLACES=662, PETRI_TRANSITIONS=675} [2024-11-10 14:37:55,297 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -57 predicate places. [2024-11-10 14:37:55,297 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 675 transitions, 1697 flow [2024-11-10 14:37:55,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 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-10 14:37:55,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,298 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-10 14:37:55,298 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1625367497, now seen corresponding path program 1 times [2024-11-10 14:37:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063032444] [2024-11-10 14:37:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063032444] [2024-11-10 14:37:55,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063032444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706706252] [2024-11-10 14:37:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 775 [2024-11-10 14:37:55,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 675 transitions, 1697 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:37:55,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 775 [2024-11-10 14:37:55,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:57,496 INFO L124 PetriNetUnfolderBase]: 773/12760 cut-off events. [2024-11-10 14:37:57,497 INFO L125 PetriNetUnfolderBase]: For 756/760 co-relation queries the response was YES. [2024-11-10 14:37:57,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16249 conditions, 12760 events. 773/12760 cut-off events. For 756/760 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 130529 event pairs, 122 based on Foata normal form. 0/12012 useless extension candidates. Maximal degree in co-relation 16017. Up to 694 conditions per place. [2024-11-10 14:37:57,810 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 22 selfloop transitions, 2 changer transitions 0/675 dead transitions. [2024-11-10 14:37:57,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 675 transitions, 1746 flow [2024-11-10 14:37:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2238 transitions. [2024-11-10 14:37:57,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625806451612903 [2024-11-10 14:37:57,812 INFO L175 Difference]: Start difference. First operand has 662 places, 675 transitions, 1697 flow. Second operand 3 states and 2238 transitions. [2024-11-10 14:37:57,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 675 transitions, 1746 flow [2024-11-10 14:37:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 675 transitions, 1740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:57,824 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1693 flow [2024-11-10 14:37:57,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1693, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2024-11-10 14:37:57,825 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -58 predicate places. [2024-11-10 14:37:57,825 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1693 flow [2024-11-10 14:37:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-10 14:37:57,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:57,826 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:37:57,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-10 14:37:57,826 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:37:57,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1590008326, now seen corresponding path program 1 times [2024-11-10 14:37:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121655269] [2024-11-10 14:37:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:37:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121655269] [2024-11-10 14:37:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121655269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904016452] [2024-11-10 14:37:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:57,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:57,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 775 [2024-11-10 14:37:57,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1693 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-10 14:37:57,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:57,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 775 [2024-11-10 14:37:57,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:00,032 INFO L124 PetriNetUnfolderBase]: 549/11552 cut-off events. [2024-11-10 14:38:00,032 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-11-10 14:38:00,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 11552 events. 549/11552 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 107098 event pairs, 41 based on Foata normal form. 0/10904 useless extension candidates. Maximal degree in co-relation 13862. Up to 223 conditions per place. [2024-11-10 14:38:00,146 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 12 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-11-10 14:38:00,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1722 flow [2024-11-10 14:38:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-11-10 14:38:00,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2024-11-10 14:38:00,147 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1693 flow. Second operand 3 states and 2250 transitions. [2024-11-10 14:38:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1722 flow [2024-11-10 14:38:00,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:00,155 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1691 flow [2024-11-10 14:38:00,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-11-10 14:38:00,156 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -59 predicate places. [2024-11-10 14:38:00,156 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1691 flow [2024-11-10 14:38:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-10 14:38:00,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:00,156 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:38:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-10 14:38:00,157 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-10 14:38:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1278458831, now seen corresponding path program 1 times [2024-11-10 14:38:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227327460] [2024-11-10 14:38:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-10 14:38:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:00,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227327460] [2024-11-10 14:38:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227327460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982986394] [2024-11-10 14:38:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:00,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:00,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:00,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:00,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:00,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 775 [2024-11-10 14:38:00,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-10 14:38:00,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:00,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 775 [2024-11-10 14:38:00,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:02,309 INFO L124 PetriNetUnfolderBase]: 659/12630 cut-off events. [2024-11-10 14:38:02,309 INFO L125 PetriNetUnfolderBase]: For 201/205 co-relation queries the response was YES. [2024-11-10 14:38:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15464 conditions, 12630 events. 659/12630 cut-off events. For 201/205 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 123111 event pairs, 70 based on Foata normal form. 0/11908 useless extension candidates. Maximal degree in co-relation 15232. Up to 307 conditions per place. [2024-11-10 14:38:02,514 INFO L140 encePairwiseOnDemand]: 772/775 looper letters, 0 selfloop transitions, 0 changer transitions 673/673 dead transitions. [2024-11-10 14:38:02,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1720 flow [2024-11-10 14:38:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-11-10 14:38:02,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2024-11-10 14:38:02,515 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1691 flow. Second operand 3 states and 2250 transitions. [2024-11-10 14:38:02,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1720 flow [2024-11-10 14:38:02,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:02,523 INFO L231 Difference]: Finished difference. Result has 659 places, 0 transitions, 0 flow [2024-11-10 14:38:02,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=775, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=659, PETRI_TRANSITIONS=0} [2024-11-10 14:38:02,523 INFO L277 CegarLoopForPetriNet]: 719 programPoint places, -60 predicate places. [2024-11-10 14:38:02,524 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 0 transitions, 0 flow [2024-11-10 14:38:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-10 14:38:02,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (189 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (188 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (187 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (186 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (185 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (184 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (183 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (182 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (181 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (180 of 190 remaining) [2024-11-10 14:38:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (178 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (177 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (176 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (175 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (174 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (173 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (172 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (171 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (170 of 190 remaining) [2024-11-10 14:38:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (169 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (168 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (167 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (166 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (165 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (164 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (163 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (162 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (161 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (160 of 190 remaining) [2024-11-10 14:38:02,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (159 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (158 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (157 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (156 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (155 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (152 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (151 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (150 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (149 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (148 of 190 remaining) [2024-11-10 14:38:02,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (147 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (146 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (145 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (144 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (143 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (142 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (141 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (140 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (139 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (138 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (137 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (136 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (135 of 190 remaining) [2024-11-10 14:38:02,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (133 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (132 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (131 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (130 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (129 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (128 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (126 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (125 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (124 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (123 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (122 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (121 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (120 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (119 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (118 of 190 remaining) [2024-11-10 14:38:02,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (117 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (116 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (111 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (108 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (107 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (106 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (105 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 190 remaining) [2024-11-10 14:38:02,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (101 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (100 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (99 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (98 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (96 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (95 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (94 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (93 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (92 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (91 of 190 remaining) [2024-11-10 14:38:02,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (89 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (85 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (84 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (83 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (82 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (81 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (80 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (79 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (78 of 190 remaining) [2024-11-10 14:38:02,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (77 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (76 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (74 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (72 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (70 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (67 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (66 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 190 remaining) [2024-11-10 14:38:02,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (63 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (62 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (61 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (60 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (59 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (58 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (56 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (55 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (54 of 190 remaining) [2024-11-10 14:38:02,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (53 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (51 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (50 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (49 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (48 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (42 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (41 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (40 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (39 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (38 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (37 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (36 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (35 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (34 of 190 remaining) [2024-11-10 14:38:02,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (33 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (31 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (29 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (27 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (24 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (21 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (20 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (19 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (18 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (17 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (16 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (15 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (13 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 190 remaining) [2024-11-10 14:38:02,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (10 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (1 of 190 remaining) [2024-11-10 14:38:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 190 remaining) [2024-11-10 14:38:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-10 14:38:02,541 INFO L407 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:02,547 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:38:02,547 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:38:02,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:38:02 BasicIcfg [2024-11-10 14:38:02,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:38:02,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:38:02,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:38:02,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:38:02,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:36:35" (3/4) ... [2024-11-10 14:38:02,556 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:38:02,559 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:38:02,559 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:38:02,564 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-11-10 14:38:02,565 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:38:02,565 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:38:02,565 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:38:02,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:38:02,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:38:02,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:38:02,647 INFO L158 Benchmark]: Toolchain (without parser) took 87816.50ms. Allocated memory was 167.8MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 95.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-10 14:38:02,647 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 119.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:38:02,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.35ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 133.8MB in the end (delta: -38.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-10 14:38:02,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.23ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 133.8MB in the beginning and 199.5MB in the end (delta: -65.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:38:02,647 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 230.7MB. Free memory was 199.5MB in the beginning and 197.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:38:02,648 INFO L158 Benchmark]: IcfgBuilder took 759.17ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 150.2MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-10 14:38:02,648 INFO L158 Benchmark]: TraceAbstraction took 86574.92ms. Allocated memory was 230.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 150.2MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-10 14:38:02,648 INFO L158 Benchmark]: Witness Printer took 91.90ms. Allocated memory is still 4.3GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:38:02,649 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.17ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 119.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.35ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 133.8MB in the end (delta: -38.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.23ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 133.8MB in the beginning and 199.5MB in the end (delta: -65.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 230.7MB. Free memory was 199.5MB in the beginning and 197.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 759.17ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 150.2MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 86574.92ms. Allocated memory was 230.7MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 150.2MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 91.90ms. Allocated memory is still 4.3GB. Free memory was 2.6GB in the beginning and 2.5GB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 62]: 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: 63]: 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: 63]: 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: 63]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 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: 78]: 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: 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: 79]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1259 locations, 190 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: 86.4s, OverallIterations: 56, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 81.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3311 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1213 mSDsluCounter, 727 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3540 IncrementalHoareTripleChecker+Invalid, 3842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 536 mSDtfsCounter, 3540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1697occurred in iteration=53, InterpolantAutomatonStates: 191, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 11116 NumberOfCodeBlocks, 11116 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 11276 ConstructedInterpolants, 0 QuantifiedInterpolants, 12337 SizeOfPredicates, 5 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 1188/1194 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 102 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:38:02,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE