./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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/parallel-barrier-loop.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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:00:46,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:00:46,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:00:46,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:00:46,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:00:46,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:00:46,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:00:46,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:00:46,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:00:46,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:00:46,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:00:46,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:00:46,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:00:46,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:00:46,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:00:46,747 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:00:46,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:00:46,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:00:46,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:00:46,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:00:46,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:00:46,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:00:46,750 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:00:46,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:00:46,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:00:46,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:00:46,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:00:46,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:00:46,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:00:46,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:00:46,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:00:46,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:00:46,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:00:46,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:00:46,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:00:46,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:00:46,757 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2024-11-09 07:00:46,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:00:46,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:00:47,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:00:47,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:00:47,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:00:47,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-09 07:00:48,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:00:48,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:00:48,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-09 07:00:48,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62b912ca/95e0b157823a4e26a80b98a1fa7c476f/FLAGf26166ba7 [2024-11-09 07:00:48,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62b912ca/95e0b157823a4e26a80b98a1fa7c476f [2024-11-09 07:00:48,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:00:48,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:00:48,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:00:48,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:00:48,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:00:48,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784e406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48, skipping insertion in model container [2024-11-09 07:00:48,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:00:48,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:00:48,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:00:48,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:00:48,798 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:00:48,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48 WrapperNode [2024-11-09 07:00:48,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:00:48,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:00:48,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:00:48,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:00:48,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,848 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 309 [2024-11-09 07:00:48,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:00:48,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:00:48,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:00:48,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:00:48,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:00:48,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:00:48,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:00:48,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:00:48,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (1/1) ... [2024-11-09 07:00:48,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:00:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:00:48,920 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-09 07:00:48,923 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-09 07:00:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:00:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:00:48,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:00:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:00:48,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:00:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 07:00:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-09 07:00:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-09 07:00:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-09 07:00:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:00:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:00:48,969 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:00:49,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:00:49,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:00:49,476 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:00:49,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:00:49,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:00:49,506 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:00:49,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:00:49 BoogieIcfgContainer [2024-11-09 07:00:49,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:00:49,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:00:49,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:00:49,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:00:49,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:00:48" (1/3) ... [2024-11-09 07:00:49,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b693e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:00:49, skipping insertion in model container [2024-11-09 07:00:49,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:00:48" (2/3) ... [2024-11-09 07:00:49,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b693e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:00:49, skipping insertion in model container [2024-11-09 07:00:49,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:00:49" (3/3) ... [2024-11-09 07:00:49,513 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-11-09 07:00:49,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:00:49,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-09 07:00:49,528 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:00:49,654 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-09 07:00:49,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2024-11-09 07:00:49,860 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2024-11-09 07:00:49,862 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:00:49,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 925 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. [2024-11-09 07:00:49,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2024-11-09 07:00:49,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2024-11-09 07:00:49,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:00:49,909 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;@60115b96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:00:49,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 07:00:49,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:00:49,920 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-11-09 07:00:49,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:00:49,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:49,921 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] [2024-11-09 07:00:49,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 684120472, now seen corresponding path program 1 times [2024-11-09 07:00:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741318549] [2024-11-09 07:00:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:50,107 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-09 07:00:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741318549] [2024-11-09 07:00:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741318549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264586505] [2024-11-09 07:00:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:50,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:50,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:50,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:50,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:50,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:50,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:50,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:50,523 INFO L124 PetriNetUnfolderBase]: 116/1711 cut-off events. [2024-11-09 07:00:50,523 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-11-09 07:00:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1711 events. 116/1711 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12312 event pairs, 56 based on Foata normal form. 157/1625 useless extension candidates. Maximal degree in co-relation 1869. Up to 151 conditions per place. [2024-11-09 07:00:50,547 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 20 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2024-11-09 07:00:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 815 flow [2024-11-09 07:00:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-09 07:00:50,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-09 07:00:50,567 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1128 transitions. [2024-11-09 07:00:50,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 815 flow [2024-11-09 07:00:50,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 786 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-09 07:00:50,579 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2024-11-09 07:00:50,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-11-09 07:00:50,584 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2024-11-09 07:00:50,585 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2024-11-09 07:00:50,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:50,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:50,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:50,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:00:50,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:50,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2031107495, now seen corresponding path program 1 times [2024-11-09 07:00:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709238798] [2024-11-09 07:00:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:50,662 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-09 07:00:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:50,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709238798] [2024-11-09 07:00:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709238798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:50,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32627127] [2024-11-09 07:00:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:50,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:50,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:50,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:50,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:50,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:50,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:50,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:50,963 INFO L124 PetriNetUnfolderBase]: 116/1709 cut-off events. [2024-11-09 07:00:50,963 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-09 07:00:50,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 1709 events. 116/1709 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11696 event pairs, 56 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 1878. Up to 151 conditions per place. [2024-11-09 07:00:50,982 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-09 07:00:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 786 flow [2024-11-09 07:00:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:50,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:50,985 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:50,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 786 flow [2024-11-09 07:00:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:50,993 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2024-11-09 07:00:50,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361} [2024-11-09 07:00:50,995 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-09 07:00:50,995 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2024-11-09 07:00:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:50,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:50,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:00:50,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:50,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1682370515, now seen corresponding path program 1 times [2024-11-09 07:00:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812860387] [2024-11-09 07:00:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:51,057 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-09 07:00:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812860387] [2024-11-09 07:00:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812860387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115344223] [2024-11-09 07:00:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:51,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:51,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:51,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:51,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:51,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:51,249 INFO L124 PetriNetUnfolderBase]: 116/1156 cut-off events. [2024-11-09 07:00:51,250 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-09 07:00:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1156 events. 116/1156 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6980 event pairs, 56 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1318. Up to 163 conditions per place. [2024-11-09 07:00:51,266 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-09 07:00:51,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 784 flow [2024-11-09 07:00:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:51,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:51,269 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 784 flow [2024-11-09 07:00:51,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:51,274 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2024-11-09 07:00:51,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360} [2024-11-09 07:00:51,275 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-09 07:00:51,276 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2024-11-09 07:00:51,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:51,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:51,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:00:51,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:51,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 510584919, now seen corresponding path program 1 times [2024-11-09 07:00:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:51,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915270663] [2024-11-09 07:00:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:51,320 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-09 07:00:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:51,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915270663] [2024-11-09 07:00:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915270663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:51,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978907062] [2024-11-09 07:00:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:51,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:51,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:51,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:51,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:51,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:51,504 INFO L124 PetriNetUnfolderBase]: 116/1155 cut-off events. [2024-11-09 07:00:51,505 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-09 07:00:51,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1155 events. 116/1155 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6823 event pairs, 56 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1310. Up to 163 conditions per place. [2024-11-09 07:00:51,518 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-09 07:00:51,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 782 flow [2024-11-09 07:00:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:51,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:51,521 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:51,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 782 flow [2024-11-09 07:00:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:51,526 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2024-11-09 07:00:51,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2024-11-09 07:00:51,527 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2024-11-09 07:00:51,527 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2024-11-09 07:00:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:51,528 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:51,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:00:51,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:51,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash -315095758, now seen corresponding path program 1 times [2024-11-09 07:00:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:51,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450553611] [2024-11-09 07:00:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:51,576 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-09 07:00:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:51,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450553611] [2024-11-09 07:00:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450553611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:51,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555153076] [2024-11-09 07:00:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:51,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:51,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:51,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:51,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:51,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:51,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:51,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:51,816 INFO L124 PetriNetUnfolderBase]: 110/1386 cut-off events. [2024-11-09 07:00:51,817 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-09 07:00:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1386 events. 110/1386 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8907 event pairs, 56 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1526. Up to 151 conditions per place. [2024-11-09 07:00:51,832 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-09 07:00:51,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 780 flow [2024-11-09 07:00:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:51,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:51,835 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 780 flow [2024-11-09 07:00:51,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:51,841 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2024-11-09 07:00:51,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358} [2024-11-09 07:00:51,842 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2024-11-09 07:00:51,842 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2024-11-09 07:00:51,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:51,843 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] [2024-11-09 07:00:51,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:00:51,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:51,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1140211658, now seen corresponding path program 1 times [2024-11-09 07:00:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484792491] [2024-11-09 07:00:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:51,889 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-09 07:00:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484792491] [2024-11-09 07:00:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484792491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858497758] [2024-11-09 07:00:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:51,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:51,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:51,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:51,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:51,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:51,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:51,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:52,088 INFO L124 PetriNetUnfolderBase]: 110/1385 cut-off events. [2024-11-09 07:00:52,089 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-09 07:00:52,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1385 events. 110/1385 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8321 event pairs, 56 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1518. Up to 151 conditions per place. [2024-11-09 07:00:52,105 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-09 07:00:52,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 778 flow [2024-11-09 07:00:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:52,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:52,109 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:52,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 778 flow [2024-11-09 07:00:52,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:52,116 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2024-11-09 07:00:52,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2024-11-09 07:00:52,117 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2024-11-09 07:00:52,117 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2024-11-09 07:00:52,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:52,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:52,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:00:52,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:52,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1776993455, now seen corresponding path program 1 times [2024-11-09 07:00:52,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:52,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26269456] [2024-11-09 07:00:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:52,165 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-09 07:00:52,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:52,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26269456] [2024-11-09 07:00:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26269456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760583619] [2024-11-09 07:00:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:52,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:52,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:52,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:52,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:52,342 INFO L124 PetriNetUnfolderBase]: 112/926 cut-off events. [2024-11-09 07:00:52,342 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-09 07:00:52,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 926 events. 112/926 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4933 event pairs, 56 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1052. Up to 163 conditions per place. [2024-11-09 07:00:52,355 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-09 07:00:52,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 776 flow [2024-11-09 07:00:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:52,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:52,357 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 776 flow [2024-11-09 07:00:52,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:52,363 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2024-11-09 07:00:52,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2024-11-09 07:00:52,365 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-09 07:00:52,366 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2024-11-09 07:00:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:52,367 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-09 07:00:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:00:52,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1223676544, now seen corresponding path program 1 times [2024-11-09 07:00:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004606444] [2024-11-09 07:00:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:00:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004606444] [2024-11-09 07:00:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004606444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560457194] [2024-11-09 07:00:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:52,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-09 07:00:52,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:52,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-09 07:00:52,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:52,541 INFO L124 PetriNetUnfolderBase]: 112/925 cut-off events. [2024-11-09 07:00:52,541 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-09 07:00:52,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 925 events. 112/925 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4886 event pairs, 56 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1044. Up to 163 conditions per place. [2024-11-09 07:00:52,551 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-09 07:00:52,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 774 flow [2024-11-09 07:00:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-09 07:00:52,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-09 07:00:52,554 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1115 transitions. [2024-11-09 07:00:52,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 774 flow [2024-11-09 07:00:52,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:52,558 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2024-11-09 07:00:52,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2024-11-09 07:00:52,559 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2024-11-09 07:00:52,559 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2024-11-09 07:00:52,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:52,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:00:52,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1915489821, now seen corresponding path program 1 times [2024-11-09 07:00:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908625749] [2024-11-09 07:00:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:52,609 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-09 07:00:52,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:52,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908625749] [2024-11-09 07:00:52,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908625749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:52,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:52,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278159016] [2024-11-09 07:00:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:52,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:52,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:52,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:52,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:52,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:52,818 INFO L124 PetriNetUnfolderBase]: 191/1845 cut-off events. [2024-11-09 07:00:52,818 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 07:00:52,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 1845 events. 191/1845 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13759 event pairs, 72 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 2122. Up to 204 conditions per place. [2024-11-09 07:00:52,837 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-09 07:00:52,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 811 flow [2024-11-09 07:00:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-09 07:00:52,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-09 07:00:52,840 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2024-11-09 07:00:52,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 811 flow [2024-11-09 07:00:52,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:52,844 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2024-11-09 07:00:52,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-09 07:00:52,845 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:52,845 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2024-11-09 07:00:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:52,846 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] [2024-11-09 07:00:52,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:00:52,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1422681314, now seen corresponding path program 1 times [2024-11-09 07:00:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811096068] [2024-11-09 07:00:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:52,882 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-09 07:00:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811096068] [2024-11-09 07:00:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811096068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106037066] [2024-11-09 07:00:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:52,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:52,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:52,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:52,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:52,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:53,101 INFO L124 PetriNetUnfolderBase]: 171/1831 cut-off events. [2024-11-09 07:00:53,101 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-09 07:00:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1831 events. 171/1831 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 13577 event pairs, 40 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 1175. Up to 129 conditions per place. [2024-11-09 07:00:53,119 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-09 07:00:53,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 836 flow [2024-11-09 07:00:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-09 07:00:53,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-09 07:00:53,121 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 728 flow. Second operand 3 states and 1138 transitions. [2024-11-09 07:00:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 836 flow [2024-11-09 07:00:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:53,127 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 732 flow [2024-11-09 07:00:53,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-09 07:00:53,128 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:53,128 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 732 flow [2024-11-09 07:00:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:53,129 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-09 07:00:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:00:53,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -894769896, now seen corresponding path program 1 times [2024-11-09 07:00:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425248686] [2024-11-09 07:00:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:53,173 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-09 07:00:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425248686] [2024-11-09 07:00:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425248686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921860645] [2024-11-09 07:00:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:53,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:53,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:53,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:53,410 INFO L124 PetriNetUnfolderBase]: 292/1806 cut-off events. [2024-11-09 07:00:53,411 INFO L125 PetriNetUnfolderBase]: For 114/130 co-relation queries the response was YES. [2024-11-09 07:00:53,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1806 events. 292/1806 cut-off events. For 114/130 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12350 event pairs, 113 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 1749. Up to 314 conditions per place. [2024-11-09 07:00:53,426 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-09 07:00:53,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 812 flow [2024-11-09 07:00:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-09 07:00:53,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-09 07:00:53,428 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 732 flow. Second operand 3 states and 1128 transitions. [2024-11-09 07:00:53,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 812 flow [2024-11-09 07:00:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 361 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:53,432 INFO L231 Difference]: Finished difference. Result has 356 places, 353 transitions, 732 flow [2024-11-09 07:00:53,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=353} [2024-11-09 07:00:53,433 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:53,433 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 353 transitions, 732 flow [2024-11-09 07:00:53,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:53,434 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-09 07:00:53,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:00:53,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 936481567, now seen corresponding path program 1 times [2024-11-09 07:00:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401731901] [2024-11-09 07:00:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:53,466 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-09 07:00:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401731901] [2024-11-09 07:00:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401731901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:53,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532285887] [2024-11-09 07:00:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:53,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:53,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 353 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:53,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:53,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:53,745 INFO L124 PetriNetUnfolderBase]: 362/2136 cut-off events. [2024-11-09 07:00:53,745 INFO L125 PetriNetUnfolderBase]: For 145/151 co-relation queries the response was YES. [2024-11-09 07:00:53,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 2136 events. 362/2136 cut-off events. For 145/151 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15290 event pairs, 119 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 2502. Up to 364 conditions per place. [2024-11-09 07:00:53,761 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-09 07:00:53,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 818 flow [2024-11-09 07:00:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-09 07:00:53,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-09 07:00:53,764 INFO L175 Difference]: Start difference. First operand has 356 places, 353 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2024-11-09 07:00:53,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 818 flow [2024-11-09 07:00:53,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:53,768 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 730 flow [2024-11-09 07:00:53,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-09 07:00:53,769 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-09 07:00:53,769 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 730 flow [2024-11-09 07:00:53,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:53,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, 1, 1, 1] [2024-11-09 07:00:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:00:53,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:53,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1521898020, now seen corresponding path program 1 times [2024-11-09 07:00:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517158478] [2024-11-09 07:00:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:53,802 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-09 07:00:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517158478] [2024-11-09 07:00:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517158478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168258025] [2024-11-09 07:00:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:53,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:53,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:53,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:53,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:53,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:54,036 INFO L124 PetriNetUnfolderBase]: 253/2046 cut-off events. [2024-11-09 07:00:54,036 INFO L125 PetriNetUnfolderBase]: For 101/113 co-relation queries the response was YES. [2024-11-09 07:00:54,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 2046 events. 253/2046 cut-off events. For 101/113 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14326 event pairs, 63 based on Foata normal form. 0/1740 useless extension candidates. Maximal degree in co-relation 2468. Up to 203 conditions per place. [2024-11-09 07:00:54,091 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-09 07:00:54,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 830 flow [2024-11-09 07:00:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-09 07:00:54,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-09 07:00:54,093 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2024-11-09 07:00:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 830 flow [2024-11-09 07:00:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 364 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:54,099 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 734 flow [2024-11-09 07:00:54,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-09 07:00:54,100 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-09 07:00:54,100 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 734 flow [2024-11-09 07:00:54,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:54,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:54,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:00:54,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1384226096, now seen corresponding path program 1 times [2024-11-09 07:00:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114261281] [2024-11-09 07:00:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:54,146 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-09 07:00:54,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114261281] [2024-11-09 07:00:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114261281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201269806] [2024-11-09 07:00:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:54,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:54,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:54,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:54,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:54,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:54,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:54,555 INFO L124 PetriNetUnfolderBase]: 414/2575 cut-off events. [2024-11-09 07:00:54,555 INFO L125 PetriNetUnfolderBase]: For 203/227 co-relation queries the response was YES. [2024-11-09 07:00:54,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 2575 events. 414/2575 cut-off events. For 203/227 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18953 event pairs, 91 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2370. Up to 307 conditions per place. [2024-11-09 07:00:54,585 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-09 07:00:54,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 835 flow [2024-11-09 07:00:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-09 07:00:54,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-09 07:00:54,588 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 734 flow. Second operand 3 states and 1137 transitions. [2024-11-09 07:00:54,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 835 flow [2024-11-09 07:00:54,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 364 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:54,592 INFO L231 Difference]: Finished difference. Result has 356 places, 352 transitions, 740 flow [2024-11-09 07:00:54,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=352} [2024-11-09 07:00:54,593 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:54,593 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 352 transitions, 740 flow [2024-11-09 07:00:54,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:54,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:54,593 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-09 07:00:54,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:00:54,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 116901643, now seen corresponding path program 1 times [2024-11-09 07:00:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336143425] [2024-11-09 07:00:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:54,623 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-09 07:00:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336143425] [2024-11-09 07:00:54,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336143425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:54,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:54,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061344561] [2024-11-09 07:00:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:54,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:54,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:54,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:54,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:54,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:54,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 352 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:54,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:54,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:54,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:54,982 INFO L124 PetriNetUnfolderBase]: 808/3108 cut-off events. [2024-11-09 07:00:54,982 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-11-09 07:00:55,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 3108 events. 808/3108 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 22162 event pairs, 266 based on Foata normal form. 0/2371 useless extension candidates. Maximal degree in co-relation 3187. Up to 797 conditions per place. [2024-11-09 07:00:55,014 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-09 07:00:55,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 825 flow [2024-11-09 07:00:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-09 07:00:55,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-09 07:00:55,018 INFO L175 Difference]: Start difference. First operand has 356 places, 352 transitions, 740 flow. Second operand 3 states and 1129 transitions. [2024-11-09 07:00:55,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 825 flow [2024-11-09 07:00:55,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:55,022 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 740 flow [2024-11-09 07:00:55,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-09 07:00:55,024 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:55,024 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 740 flow [2024-11-09 07:00:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:55,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:55,025 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] [2024-11-09 07:00:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:00:55,025 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -600548039, now seen corresponding path program 1 times [2024-11-09 07:00:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901906328] [2024-11-09 07:00:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:55,060 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-09 07:00:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901906328] [2024-11-09 07:00:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901906328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320771896] [2024-11-09 07:00:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:55,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:55,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:55,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:55,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:55,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:55,463 INFO L124 PetriNetUnfolderBase]: 609/3336 cut-off events. [2024-11-09 07:00:55,464 INFO L125 PetriNetUnfolderBase]: For 401/434 co-relation queries the response was YES. [2024-11-09 07:00:55,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 3336 events. 609/3336 cut-off events. For 401/434 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24794 event pairs, 142 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 3120. Up to 466 conditions per place. [2024-11-09 07:00:55,494 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 29 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-09 07:00:55,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 837 flow [2024-11-09 07:00:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-09 07:00:55,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-09 07:00:55,497 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 740 flow. Second operand 3 states and 1136 transitions. [2024-11-09 07:00:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 837 flow [2024-11-09 07:00:55,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:55,503 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 744 flow [2024-11-09 07:00:55,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-09 07:00:55,504 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:55,504 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 744 flow [2024-11-09 07:00:55,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:55,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:55,505 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] [2024-11-09 07:00:55,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:00:55,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2071319894, now seen corresponding path program 1 times [2024-11-09 07:00:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658571535] [2024-11-09 07:00:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:55,543 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-09 07:00:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658571535] [2024-11-09 07:00:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658571535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173386563] [2024-11-09 07:00:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:55,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:55,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:55,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:55,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:55,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:55,941 INFO L124 PetriNetUnfolderBase]: 486/3093 cut-off events. [2024-11-09 07:00:55,941 INFO L125 PetriNetUnfolderBase]: For 209/319 co-relation queries the response was YES. [2024-11-09 07:00:55,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 3093 events. 486/3093 cut-off events. For 209/319 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24185 event pairs, 188 based on Foata normal form. 9/2597 useless extension candidates. Maximal degree in co-relation 3190. Up to 569 conditions per place. [2024-11-09 07:00:55,971 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-09 07:00:55,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 825 flow [2024-11-09 07:00:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-09 07:00:55,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-09 07:00:55,973 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 744 flow. Second operand 3 states and 1128 transitions. [2024-11-09 07:00:55,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 825 flow [2024-11-09 07:00:55,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:55,977 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 744 flow [2024-11-09 07:00:55,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-09 07:00:55,978 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:55,978 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 744 flow [2024-11-09 07:00:55,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:55,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:55,979 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] [2024-11-09 07:00:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:00:55,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -894883096, now seen corresponding path program 1 times [2024-11-09 07:00:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:55,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16900211] [2024-11-09 07:00:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:56,010 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-09 07:00:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16900211] [2024-11-09 07:00:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16900211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:56,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374881160] [2024-11-09 07:00:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:56,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:56,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:56,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:56,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:56,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:56,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:56,436 INFO L124 PetriNetUnfolderBase]: 406/2971 cut-off events. [2024-11-09 07:00:56,437 INFO L125 PetriNetUnfolderBase]: For 218/296 co-relation queries the response was YES. [2024-11-09 07:00:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 2971 events. 406/2971 cut-off events. For 218/296 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 23189 event pairs, 89 based on Foata normal form. 9/2535 useless extension candidates. Maximal degree in co-relation 2949. Up to 299 conditions per place. [2024-11-09 07:00:56,465 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-09 07:00:56,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 852 flow [2024-11-09 07:00:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-09 07:00:56,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-09 07:00:56,468 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 744 flow. Second operand 3 states and 1138 transitions. [2024-11-09 07:00:56,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 852 flow [2024-11-09 07:00:56,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 363 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:56,474 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 748 flow [2024-11-09 07:00:56,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-09 07:00:56,475 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:56,475 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 748 flow [2024-11-09 07:00:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:56,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:56,476 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] [2024-11-09 07:00:56,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:00:56,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 911133796, now seen corresponding path program 1 times [2024-11-09 07:00:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:56,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379416705] [2024-11-09 07:00:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:56,520 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-09 07:00:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379416705] [2024-11-09 07:00:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379416705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812744367] [2024-11-09 07:00:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:56,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:56,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:56,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:56,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:56,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:57,080 INFO L124 PetriNetUnfolderBase]: 528/2947 cut-off events. [2024-11-09 07:00:57,081 INFO L125 PetriNetUnfolderBase]: For 254/390 co-relation queries the response was YES. [2024-11-09 07:00:57,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 2947 events. 528/2947 cut-off events. For 254/390 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22520 event pairs, 215 based on Foata normal form. 10/2465 useless extension candidates. Maximal degree in co-relation 3009. Up to 610 conditions per place. [2024-11-09 07:00:57,118 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-09 07:00:57,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 828 flow [2024-11-09 07:00:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-09 07:00:57,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-09 07:00:57,122 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 748 flow. Second operand 3 states and 1128 transitions. [2024-11-09 07:00:57,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 828 flow [2024-11-09 07:00:57,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 357 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:57,129 INFO L231 Difference]: Finished difference. Result has 356 places, 349 transitions, 748 flow [2024-11-09 07:00:57,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=349} [2024-11-09 07:00:57,130 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:57,130 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 349 transitions, 748 flow [2024-11-09 07:00:57,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:57,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:57,130 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] [2024-11-09 07:00:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:00:57,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1204443032, now seen corresponding path program 1 times [2024-11-09 07:00:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380586006] [2024-11-09 07:00:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:57,165 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-09 07:00:57,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:57,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380586006] [2024-11-09 07:00:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380586006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854290287] [2024-11-09 07:00:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:57,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:57,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:57,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:57,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:57,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:57,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:57,582 INFO L124 PetriNetUnfolderBase]: 712/3261 cut-off events. [2024-11-09 07:00:57,583 INFO L125 PetriNetUnfolderBase]: For 341/399 co-relation queries the response was YES. [2024-11-09 07:00:57,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 3261 events. 712/3261 cut-off events. For 341/399 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 24931 event pairs, 245 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3441. Up to 744 conditions per place. [2024-11-09 07:00:57,616 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-09 07:00:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 834 flow [2024-11-09 07:00:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-09 07:00:57,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-09 07:00:57,618 INFO L175 Difference]: Start difference. First operand has 356 places, 349 transitions, 748 flow. Second operand 3 states and 1129 transitions. [2024-11-09 07:00:57,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 834 flow [2024-11-09 07:00:57,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:57,623 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 746 flow [2024-11-09 07:00:57,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-09 07:00:57,623 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-09 07:00:57,623 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 746 flow [2024-11-09 07:00:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:57,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:57,624 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] [2024-11-09 07:00:57,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:00:57,624 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -605340477, now seen corresponding path program 1 times [2024-11-09 07:00:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123272536] [2024-11-09 07:00:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:00:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123272536] [2024-11-09 07:00:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123272536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043663131] [2024-11-09 07:00:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:57,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:57,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:57,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:57,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:57,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:57,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:58,031 INFO L124 PetriNetUnfolderBase]: 433/3145 cut-off events. [2024-11-09 07:00:58,031 INFO L125 PetriNetUnfolderBase]: For 210/326 co-relation queries the response was YES. [2024-11-09 07:00:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3145 events. 433/3145 cut-off events. For 210/326 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24504 event pairs, 105 based on Foata normal form. 10/2700 useless extension candidates. Maximal degree in co-relation 3049. Up to 339 conditions per place. [2024-11-09 07:00:58,068 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-09 07:00:58,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 846 flow [2024-11-09 07:00:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-09 07:00:58,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-09 07:00:58,071 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 746 flow. Second operand 3 states and 1137 transitions. [2024-11-09 07:00:58,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 846 flow [2024-11-09 07:00:58,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 360 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:58,076 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 750 flow [2024-11-09 07:00:58,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-09 07:00:58,076 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-09 07:00:58,077 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 750 flow [2024-11-09 07:00:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:58,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:58,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:00:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:00:58,077 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:58,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1406560618, now seen corresponding path program 1 times [2024-11-09 07:00:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424647966] [2024-11-09 07:00:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:58,107 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-09 07:00:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424647966] [2024-11-09 07:00:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424647966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:58,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:58,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:58,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321116782] [2024-11-09 07:00:58,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:58,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:58,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:58,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:58,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:58,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:58,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:58,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:58,515 INFO L124 PetriNetUnfolderBase]: 542/3144 cut-off events. [2024-11-09 07:00:58,515 INFO L125 PetriNetUnfolderBase]: For 272/318 co-relation queries the response was YES. [2024-11-09 07:00:58,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 3144 events. 542/3144 cut-off events. For 272/318 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 23785 event pairs, 117 based on Foata normal form. 0/2622 useless extension candidates. Maximal degree in co-relation 3199. Up to 399 conditions per place. [2024-11-09 07:00:58,551 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-09 07:00:58,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 851 flow [2024-11-09 07:00:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-09 07:00:58,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-09 07:00:58,554 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 750 flow. Second operand 3 states and 1137 transitions. [2024-11-09 07:00:58,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 851 flow [2024-11-09 07:00:58,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:58,558 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 756 flow [2024-11-09 07:00:58,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=348} [2024-11-09 07:00:58,559 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:58,559 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 756 flow [2024-11-09 07:00:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:58,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:58,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:58,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:00:58,560 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1175845953, now seen corresponding path program 1 times [2024-11-09 07:00:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433381861] [2024-11-09 07:00:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:58,591 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-09 07:00:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433381861] [2024-11-09 07:00:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433381861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825199585] [2024-11-09 07:00:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:58,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:58,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-09 07:00:58,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 348 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:58,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:58,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-09 07:00:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:59,070 INFO L124 PetriNetUnfolderBase]: 821/3691 cut-off events. [2024-11-09 07:00:59,070 INFO L125 PetriNetUnfolderBase]: For 436/461 co-relation queries the response was YES. [2024-11-09 07:00:59,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5078 conditions, 3691 events. 821/3691 cut-off events. For 436/461 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 28606 event pairs, 290 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3607. Up to 836 conditions per place. [2024-11-09 07:00:59,095 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-09 07:00:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 841 flow [2024-11-09 07:00:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-09 07:00:59,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-09 07:00:59,098 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 756 flow. Second operand 3 states and 1129 transitions. [2024-11-09 07:00:59,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 841 flow [2024-11-09 07:00:59,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:59,102 INFO L231 Difference]: Finished difference. Result has 356 places, 347 transitions, 756 flow [2024-11-09 07:00:59,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=347} [2024-11-09 07:00:59,102 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-09 07:00:59,102 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 756 flow [2024-11-09 07:00:59,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:59,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:59,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:00:59,103 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-09 07:00:59,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash -125379082, now seen corresponding path program 1 times [2024-11-09 07:00:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225345883] [2024-11-09 07:00:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:59,129 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-09 07:00:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225345883] [2024-11-09 07:00:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225345883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204154472] [2024-11-09 07:00:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:59,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:59,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-09 07:00:59,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 347 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:59,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:59,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-09 07:00:59,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:59,546 INFO L124 PetriNetUnfolderBase]: 609/3532 cut-off events. [2024-11-09 07:00:59,546 INFO L125 PetriNetUnfolderBase]: For 401/426 co-relation queries the response was YES. [2024-11-09 07:00:59,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 3532 events. 609/3532 cut-off events. For 401/426 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 27041 event pairs, 142 based on Foata normal form. 0/2964 useless extension candidates. Maximal degree in co-relation 3375. Up to 466 conditions per place. [2024-11-09 07:00:59,584 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-11-09 07:00:59,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 853 flow [2024-11-09 07:00:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-09 07:00:59,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-09 07:00:59,588 INFO L175 Difference]: Start difference. First operand has 356 places, 347 transitions, 756 flow. Second operand 3 states and 1136 transitions. [2024-11-09 07:00:59,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 853 flow [2024-11-09 07:00:59,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:59,592 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2024-11-09 07:00:59,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=355, PETRI_TRANSITIONS=0} [2024-11-09 07:00:59,593 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-09 07:00:59,593 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2024-11-09 07:00:59,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:59,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-09 07:00:59,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 50 remaining) [2024-11-09 07:00:59,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-09 07:00:59,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-09 07:00:59,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-09 07:00:59,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:00:59,600 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:59,604 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:00:59,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:00:59,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:00:59 BasicIcfg [2024-11-09 07:00:59,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:00:59,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:00:59,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:00:59,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:00:59,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:00:49" (3/4) ... [2024-11-09 07:00:59,610 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:00:59,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:00:59,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:00:59,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:00:59,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-09 07:00:59,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-09 07:00:59,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-09 07:00:59,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:00:59,618 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:00:59,618 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:00:59,618 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:00:59,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:00:59,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:00:59,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:00:59,685 INFO L158 Benchmark]: Toolchain (without parser) took 11204.69ms. Allocated memory was 195.0MB in the beginning and 878.7MB in the end (delta: 683.7MB). Free memory was 163.5MB in the beginning and 397.5MB in the end (delta: -233.9MB). Peak memory consumption was 449.5MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,685 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:00:59,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.05ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 154.2MB in the end (delta: 9.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.46ms. Allocated memory is still 195.0MB. Free memory was 154.2MB in the beginning and 151.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,687 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 195.0MB. Free memory was 151.3MB in the beginning and 149.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,687 INFO L158 Benchmark]: RCFGBuilder took 625.85ms. Allocated memory is still 195.0MB. Free memory was 149.2MB in the beginning and 122.7MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,687 INFO L158 Benchmark]: TraceAbstraction took 10099.44ms. Allocated memory was 195.0MB in the beginning and 878.7MB in the end (delta: 683.7MB). Free memory was 121.9MB in the beginning and 402.7MB in the end (delta: -280.8MB). Peak memory consumption was 402.4MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,688 INFO L158 Benchmark]: Witness Printer took 76.41ms. Allocated memory is still 878.7MB. Free memory was 402.7MB in the beginning and 397.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:00:59,689 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.14ms. Allocated memory is still 130.0MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.05ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 154.2MB in the end (delta: 9.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.46ms. Allocated memory is still 195.0MB. Free memory was 154.2MB in the beginning and 151.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 195.0MB. Free memory was 151.3MB in the beginning and 149.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.85ms. Allocated memory is still 195.0MB. Free memory was 149.2MB in the beginning and 122.7MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10099.44ms. Allocated memory was 195.0MB in the beginning and 878.7MB in the end (delta: 683.7MB). Free memory was 121.9MB in the beginning and 402.7MB in the end (delta: -280.8MB). Peak memory consumption was 402.4MB. Max. memory is 16.1GB. * Witness Printer took 76.41ms. Allocated memory is still 878.7MB. Free memory was 402.7MB in the beginning and 397.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 61]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 111]: 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: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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 13 procedures, 613 locations, 50 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: 9.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 103 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2964 ConstructedInterpolants, 0 QuantifiedInterpolants, 3012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:00:59,711 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