./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 13:54:10,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:54:10,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:54:10,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:54:10,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:54:10,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:54:10,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:54:10,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:54:10,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:54:10,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:54:10,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:54:10,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:54:10,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:54:10,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:54:10,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:54:10,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:54:10,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:54:10,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:54:10,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:54:10,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:54:10,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:54:10,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:54:10,683 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:54:10,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:54:10,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:54:10,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:54:10,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:54:10,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:54:10,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:54:10,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:54:10,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:54:10,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:54:10,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:54:10,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:54:10,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:54:10,687 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-20 13:54:10,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:54:10,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:54:10,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:54:10,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:54:10,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:54:10,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-20 13:54:12,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:54:12,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:54:12,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-20 13:54:12,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed526299/0dc3772c31694ee7936956ec281b1434/FLAGe36869df6 [2024-11-20 13:54:12,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed526299/0dc3772c31694ee7936956ec281b1434 [2024-11-20 13:54:12,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:54:12,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:54:12,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:54:12,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:54:12,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:54:12,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:12,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c73d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12, skipping insertion in model container [2024-11-20 13:54:12,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:12,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:54:12,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:54:12,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:54:12,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:54:12,966 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:54:12,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12 WrapperNode [2024-11-20 13:54:12,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:54:12,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:54:12,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:54:12,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:54:12,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:12,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:12,997 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 309 [2024-11-20 13:54:12,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:54:12,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:54:12,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:54:12,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:54:13,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:54:13,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:54:13,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:54:13,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:54:13,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (1/1) ... [2024-11-20 13:54:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:54:13,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:54:13,067 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-20 13:54:13,068 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-20 13:54:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:54:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 13:54:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 13:54:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-20 13:54:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-20 13:54:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-20 13:54:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-20 13:54:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-20 13:54:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-20 13:54:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:54:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:54:13,101 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:54:13,193 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:54:13,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:54:13,514 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:54:13,515 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:54:13,533 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:54:13,535 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 13:54:13,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:13 BoogieIcfgContainer [2024-11-20 13:54:13,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:54:13,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:54:13,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:54:13,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:54:13,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:54:12" (1/3) ... [2024-11-20 13:54:13,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c35654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:54:13, skipping insertion in model container [2024-11-20 13:54:13,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:12" (2/3) ... [2024-11-20 13:54:13,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c35654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:54:13, skipping insertion in model container [2024-11-20 13:54:13,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:13" (3/3) ... [2024-11-20 13:54:13,543 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-11-20 13:54:13,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:54:13,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-20 13:54:13,556 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:54:13,678 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-20 13:54:13,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2024-11-20 13:54:13,852 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2024-11-20 13:54:13,853 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 13:54:13,867 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-20 13:54:13,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2024-11-20 13:54:13,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2024-11-20 13:54:13,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:54:13,889 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;@44a0304d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:54:13,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-20 13:54:13,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:54:13,896 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-11-20 13:54:13,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:54:13,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:13,896 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-20 13:54:13,897 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-20 13:54:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash 684120472, now seen corresponding path program 1 times [2024-11-20 13:54:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267781702] [2024-11-20 13:54:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:14,079 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-20 13:54:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267781702] [2024-11-20 13:54:14,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267781702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:14,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:14,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481151020] [2024-11-20 13:54:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:14,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:14,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:14,141 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-20 13:54:14,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:14,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:14,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:14,438 INFO L124 PetriNetUnfolderBase]: 116/1711 cut-off events. [2024-11-20 13:54:14,439 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-11-20 13:54:14,453 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-20 13:54:14,462 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 20 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2024-11-20 13:54:14,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 815 flow [2024-11-20 13:54:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-20 13:54:14,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-20 13:54:14,481 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1128 transitions. [2024-11-20 13:54:14,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 815 flow [2024-11-20 13:54:14,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 786 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-20 13:54:14,493 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2024-11-20 13:54:14,495 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-20 13:54:14,498 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2024-11-20 13:54:14,498 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2024-11-20 13:54:14,499 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-20 13:54:14,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:14,499 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-20 13:54:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:54:14,500 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-20 13:54:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2031107495, now seen corresponding path program 1 times [2024-11-20 13:54:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361322408] [2024-11-20 13:54:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:54:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361322408] [2024-11-20 13:54:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361322408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41206803] [2024-11-20 13:54:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:14,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:14,602 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-20 13:54:14,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:14,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:14,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:14,889 INFO L124 PetriNetUnfolderBase]: 116/1709 cut-off events. [2024-11-20 13:54:14,889 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-20 13:54:14,897 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-20 13:54:14,902 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-20 13:54:14,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 786 flow [2024-11-20 13:54:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:14,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:14,905 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:14,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 786 flow [2024-11-20 13:54:14,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:14,910 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2024-11-20 13:54:14,910 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-20 13:54:14,911 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-20 13:54:14,911 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2024-11-20 13:54:14,912 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-20 13:54:14,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:14,912 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-20 13:54:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:54:14,912 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-20 13:54:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1682370515, now seen corresponding path program 1 times [2024-11-20 13:54:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524722266] [2024-11-20 13:54:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:14,967 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-20 13:54:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:14,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524722266] [2024-11-20 13:54:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524722266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:14,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589177225] [2024-11-20 13:54:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:14,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:14,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:14,987 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-20 13:54:14,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:14,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:14,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:15,170 INFO L124 PetriNetUnfolderBase]: 116/1156 cut-off events. [2024-11-20 13:54:15,170 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-20 13:54:15,178 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-20 13:54:15,183 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-20 13:54:15,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 784 flow [2024-11-20 13:54:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:15,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:15,186 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:15,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 784 flow [2024-11-20 13:54:15,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:15,191 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2024-11-20 13:54:15,191 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-20 13:54:15,192 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-20 13:54:15,192 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2024-11-20 13:54:15,193 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-20 13:54:15,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:15,193 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-20 13:54:15,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:54:15,193 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-20 13:54:15,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 510584919, now seen corresponding path program 1 times [2024-11-20 13:54:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695738062] [2024-11-20 13:54:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:15,241 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-20 13:54:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695738062] [2024-11-20 13:54:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695738062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:15,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732729541] [2024-11-20 13:54:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:15,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:15,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:15,260 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-20 13:54:15,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:15,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:15,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:15,403 INFO L124 PetriNetUnfolderBase]: 116/1155 cut-off events. [2024-11-20 13:54:15,404 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-20 13:54:15,412 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-20 13:54:15,417 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-20 13:54:15,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 782 flow [2024-11-20 13:54:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:15,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:15,420 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:15,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 782 flow [2024-11-20 13:54:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:15,424 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2024-11-20 13:54:15,424 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-20 13:54:15,425 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2024-11-20 13:54:15,425 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2024-11-20 13:54:15,425 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-20 13:54:15,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:15,426 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-20 13:54:15,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:54:15,426 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-20 13:54:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash -315095758, now seen corresponding path program 1 times [2024-11-20 13:54:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786238740] [2024-11-20 13:54:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:54:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786238740] [2024-11-20 13:54:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786238740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097620704] [2024-11-20 13:54:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:15,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:15,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:15,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:15,472 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-20 13:54:15,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:15,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:15,661 INFO L124 PetriNetUnfolderBase]: 110/1386 cut-off events. [2024-11-20 13:54:15,661 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-20 13:54:15,672 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-20 13:54:15,679 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-20 13:54:15,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 780 flow [2024-11-20 13:54:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:15,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:15,681 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:15,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 780 flow [2024-11-20 13:54:15,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:15,686 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2024-11-20 13:54:15,686 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-20 13:54:15,687 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2024-11-20 13:54:15,687 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2024-11-20 13:54:15,688 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-20 13:54:15,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:15,688 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-20 13:54:15,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:54:15,688 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-20 13:54:15,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1140211658, now seen corresponding path program 1 times [2024-11-20 13:54:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:15,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676880997] [2024-11-20 13:54:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:54:15,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676880997] [2024-11-20 13:54:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676880997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333280791] [2024-11-20 13:54:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:15,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:15,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:15,729 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-20 13:54:15,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:15,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:15,878 INFO L124 PetriNetUnfolderBase]: 110/1385 cut-off events. [2024-11-20 13:54:15,878 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-20 13:54:15,888 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-20 13:54:15,896 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-20 13:54:15,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 778 flow [2024-11-20 13:54:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:15,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:15,900 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:15,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 778 flow [2024-11-20 13:54:15,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:15,904 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2024-11-20 13:54:15,904 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-20 13:54:15,906 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2024-11-20 13:54:15,906 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2024-11-20 13:54:15,907 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-20 13:54:15,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:15,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:54:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:54:15,908 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-20 13:54:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1776993455, now seen corresponding path program 1 times [2024-11-20 13:54:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659409871] [2024-11-20 13:54:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:15,935 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-20 13:54:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659409871] [2024-11-20 13:54:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659409871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:15,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374346744] [2024-11-20 13:54:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:15,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:15,952 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-20 13:54:15,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:15,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:15,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:16,066 INFO L124 PetriNetUnfolderBase]: 112/926 cut-off events. [2024-11-20 13:54:16,066 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-20 13:54:16,070 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-20 13:54:16,073 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-20 13:54:16,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 776 flow [2024-11-20 13:54:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:16,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:16,075 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:16,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 776 flow [2024-11-20 13:54:16,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:16,079 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2024-11-20 13:54:16,079 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-20 13:54:16,080 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-20 13:54:16,080 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2024-11-20 13:54:16,081 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-20 13:54:16,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:16,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:54:16,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:54:16,081 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-20 13:54:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1223676544, now seen corresponding path program 1 times [2024-11-20 13:54:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141404894] [2024-11-20 13:54:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:16,110 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-20 13:54:16,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141404894] [2024-11-20 13:54:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141404894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363167968] [2024-11-20 13:54:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:16,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-20 13:54:16,130 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-20 13:54:16,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:16,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-20 13:54:16,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:16,230 INFO L124 PetriNetUnfolderBase]: 112/925 cut-off events. [2024-11-20 13:54:16,230 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-20 13:54:16,238 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-20 13:54:16,242 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-20 13:54:16,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 774 flow [2024-11-20 13:54:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-20 13:54:16,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-20 13:54:16,245 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1115 transitions. [2024-11-20 13:54:16,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 774 flow [2024-11-20 13:54:16,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:16,249 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2024-11-20 13:54:16,249 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-20 13:54:16,250 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2024-11-20 13:54:16,250 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2024-11-20 13:54:16,251 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-20 13:54:16,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:16,251 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-20 13:54:16,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:54:16,252 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-20 13:54:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1915489821, now seen corresponding path program 1 times [2024-11-20 13:54:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:16,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254250363] [2024-11-20 13:54:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:16,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-20 13:54:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:16,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254250363] [2024-11-20 13:54:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254250363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268286691] [2024-11-20 13:54:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:16,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:16,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:16,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:16,337 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-20 13:54:16,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:16,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:16,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:16,533 INFO L124 PetriNetUnfolderBase]: 191/1845 cut-off events. [2024-11-20 13:54:16,533 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-20 13:54:16,546 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-20 13:54:16,552 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-20 13:54:16,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 811 flow [2024-11-20 13:54:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-20 13:54:16,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-20 13:54:16,554 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2024-11-20 13:54:16,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 811 flow [2024-11-20 13:54:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:16,558 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2024-11-20 13:54:16,559 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-20 13:54:16,559 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:16,560 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2024-11-20 13:54:16,560 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-20 13:54:16,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:16,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, 1, 1, 1] [2024-11-20 13:54:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:54:16,561 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-20 13:54:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1422681314, now seen corresponding path program 1 times [2024-11-20 13:54:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112252790] [2024-11-20 13:54:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:16,607 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-20 13:54:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112252790] [2024-11-20 13:54:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112252790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279055227] [2024-11-20 13:54:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:16,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:16,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:16,619 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-20 13:54:16,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:16,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:16,808 INFO L124 PetriNetUnfolderBase]: 171/1831 cut-off events. [2024-11-20 13:54:16,809 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-20 13:54:16,821 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-20 13:54:16,827 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-20 13:54:16,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 836 flow [2024-11-20 13:54:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-20 13:54:16,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-20 13:54:16,829 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 728 flow. Second operand 3 states and 1138 transitions. [2024-11-20 13:54:16,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 836 flow [2024-11-20 13:54:16,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:16,835 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 732 flow [2024-11-20 13:54:16,836 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-20 13:54:16,837 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:16,837 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 732 flow [2024-11-20 13:54:16,838 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-20 13:54:16,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:16,838 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-20 13:54:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:54:16,838 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-20 13:54:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -894769896, now seen corresponding path program 1 times [2024-11-20 13:54:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651720256] [2024-11-20 13:54:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:16,878 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-20 13:54:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651720256] [2024-11-20 13:54:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651720256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386913751] [2024-11-20 13:54:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:16,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:16,892 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-20 13:54:16,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:16,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:16,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:17,125 INFO L124 PetriNetUnfolderBase]: 292/1806 cut-off events. [2024-11-20 13:54:17,125 INFO L125 PetriNetUnfolderBase]: For 114/130 co-relation queries the response was YES. [2024-11-20 13:54:17,140 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-20 13:54:17,147 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-20 13:54:17,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 812 flow [2024-11-20 13:54:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-20 13:54:17,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-20 13:54:17,149 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 732 flow. Second operand 3 states and 1128 transitions. [2024-11-20 13:54:17,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 812 flow [2024-11-20 13:54:17,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 361 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:17,152 INFO L231 Difference]: Finished difference. Result has 356 places, 353 transitions, 732 flow [2024-11-20 13:54:17,153 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-20 13:54:17,153 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:17,153 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 353 transitions, 732 flow [2024-11-20 13:54:17,154 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-20 13:54:17,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:17,154 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-20 13:54:17,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:54:17,154 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-20 13:54:17,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 936481567, now seen corresponding path program 1 times [2024-11-20 13:54:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712094278] [2024-11-20 13:54:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:17,185 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-20 13:54:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712094278] [2024-11-20 13:54:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712094278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911765606] [2024-11-20 13:54:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:17,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:17,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:17,198 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-20 13:54:17,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:17,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:17,424 INFO L124 PetriNetUnfolderBase]: 362/2136 cut-off events. [2024-11-20 13:54:17,424 INFO L125 PetriNetUnfolderBase]: For 145/151 co-relation queries the response was YES. [2024-11-20 13:54:17,441 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-20 13:54:17,449 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-20 13:54:17,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 818 flow [2024-11-20 13:54:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-20 13:54:17,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-20 13:54:17,451 INFO L175 Difference]: Start difference. First operand has 356 places, 353 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2024-11-20 13:54:17,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 818 flow [2024-11-20 13:54:17,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:17,455 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 730 flow [2024-11-20 13:54:17,456 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-20 13:54:17,456 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-20 13:54:17,456 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 730 flow [2024-11-20 13:54:17,457 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-20 13:54:17,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:17,457 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-20 13:54:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:54:17,457 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-20 13:54:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1521898020, now seen corresponding path program 1 times [2024-11-20 13:54:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678731584] [2024-11-20 13:54:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:17,496 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-20 13:54:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678731584] [2024-11-20 13:54:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678731584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955587993] [2024-11-20 13:54:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:17,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:17,511 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-20 13:54:17,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:17,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:17,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:17,737 INFO L124 PetriNetUnfolderBase]: 253/2046 cut-off events. [2024-11-20 13:54:17,738 INFO L125 PetriNetUnfolderBase]: For 101/113 co-relation queries the response was YES. [2024-11-20 13:54:17,750 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-20 13:54:17,755 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-20 13:54:17,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 830 flow [2024-11-20 13:54:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-20 13:54:17,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-20 13:54:17,757 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2024-11-20 13:54:17,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 830 flow [2024-11-20 13:54:17,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 364 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:17,761 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 734 flow [2024-11-20 13:54:17,761 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-20 13:54:17,762 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-20 13:54:17,762 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 734 flow [2024-11-20 13:54:17,762 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-20 13:54:17,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:17,763 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-20 13:54:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 13:54:17,763 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-20 13:54:17,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1384226096, now seen corresponding path program 1 times [2024-11-20 13:54:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836883622] [2024-11-20 13:54:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:17,793 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-20 13:54:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836883622] [2024-11-20 13:54:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836883622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451523201] [2024-11-20 13:54:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:17,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:17,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:17,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:17,802 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-20 13:54:17,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:17,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:17,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:18,079 INFO L124 PetriNetUnfolderBase]: 414/2575 cut-off events. [2024-11-20 13:54:18,079 INFO L125 PetriNetUnfolderBase]: For 203/227 co-relation queries the response was YES. [2024-11-20 13:54:18,097 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-20 13:54:18,106 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-20 13:54:18,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 835 flow [2024-11-20 13:54:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-20 13:54:18,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-20 13:54:18,108 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 734 flow. Second operand 3 states and 1137 transitions. [2024-11-20 13:54:18,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 835 flow [2024-11-20 13:54:18,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 364 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:18,112 INFO L231 Difference]: Finished difference. Result has 356 places, 352 transitions, 740 flow [2024-11-20 13:54:18,112 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-20 13:54:18,113 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:18,113 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 352 transitions, 740 flow [2024-11-20 13:54:18,113 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-20 13:54:18,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:18,114 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-20 13:54:18,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 13:54:18,114 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-20 13:54:18,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 116901643, now seen corresponding path program 1 times [2024-11-20 13:54:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58249298] [2024-11-20 13:54:18,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:18,153 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-20 13:54:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:18,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58249298] [2024-11-20 13:54:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58249298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:18,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133629506] [2024-11-20 13:54:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:18,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:18,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:18,166 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-20 13:54:18,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:18,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:18,578 INFO L124 PetriNetUnfolderBase]: 808/3108 cut-off events. [2024-11-20 13:54:18,579 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-11-20 13:54:18,601 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-20 13:54:18,614 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-20 13:54:18,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 825 flow [2024-11-20 13:54:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-20 13:54:18,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-20 13:54:18,617 INFO L175 Difference]: Start difference. First operand has 356 places, 352 transitions, 740 flow. Second operand 3 states and 1129 transitions. [2024-11-20 13:54:18,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 825 flow [2024-11-20 13:54:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:18,626 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 740 flow [2024-11-20 13:54:18,627 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-20 13:54:18,627 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:18,627 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 740 flow [2024-11-20 13:54:18,628 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-20 13:54:18,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:18,628 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-20 13:54:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 13:54:18,628 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-20 13:54:18,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -600548039, now seen corresponding path program 1 times [2024-11-20 13:54:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030706198] [2024-11-20 13:54:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:18,675 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-20 13:54:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030706198] [2024-11-20 13:54:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030706198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:18,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755671901] [2024-11-20 13:54:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:18,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:18,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:18,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:18,690 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-20 13:54:18,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:18,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:18,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:19,075 INFO L124 PetriNetUnfolderBase]: 609/3336 cut-off events. [2024-11-20 13:54:19,075 INFO L125 PetriNetUnfolderBase]: For 401/434 co-relation queries the response was YES. [2024-11-20 13:54:19,094 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-20 13:54:19,107 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 29 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-20 13:54:19,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 837 flow [2024-11-20 13:54:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-20 13:54:19,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-20 13:54:19,110 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 740 flow. Second operand 3 states and 1136 transitions. [2024-11-20 13:54:19,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 837 flow [2024-11-20 13:54:19,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:19,118 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 744 flow [2024-11-20 13:54:19,118 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-20 13:54:19,118 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:19,119 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 744 flow [2024-11-20 13:54:19,119 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-20 13:54:19,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:19,119 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-20 13:54:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 13:54:19,120 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-20 13:54:19,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2071319894, now seen corresponding path program 1 times [2024-11-20 13:54:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095231825] [2024-11-20 13:54:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:19,150 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-20 13:54:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095231825] [2024-11-20 13:54:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095231825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651450180] [2024-11-20 13:54:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:19,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:19,164 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-20 13:54:19,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:19,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:19,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:19,528 INFO L124 PetriNetUnfolderBase]: 486/3093 cut-off events. [2024-11-20 13:54:19,528 INFO L125 PetriNetUnfolderBase]: For 209/319 co-relation queries the response was YES. [2024-11-20 13:54:19,547 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-20 13:54:19,558 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-20 13:54:19,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 825 flow [2024-11-20 13:54:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-20 13:54:19,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-20 13:54:19,560 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 744 flow. Second operand 3 states and 1128 transitions. [2024-11-20 13:54:19,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 825 flow [2024-11-20 13:54:19,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:19,564 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 744 flow [2024-11-20 13:54:19,564 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-20 13:54:19,565 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:19,565 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 744 flow [2024-11-20 13:54:19,565 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-20 13:54:19,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:19,566 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-20 13:54:19,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 13:54:19,566 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-20 13:54:19,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -894883096, now seen corresponding path program 1 times [2024-11-20 13:54:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578447290] [2024-11-20 13:54:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:54:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578447290] [2024-11-20 13:54:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578447290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059882877] [2024-11-20 13:54:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:19,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:19,604 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-20 13:54:19,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:19,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:19,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:19,966 INFO L124 PetriNetUnfolderBase]: 406/2971 cut-off events. [2024-11-20 13:54:19,966 INFO L125 PetriNetUnfolderBase]: For 218/296 co-relation queries the response was YES. [2024-11-20 13:54:19,981 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-20 13:54:19,988 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-20 13:54:19,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 852 flow [2024-11-20 13:54:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-20 13:54:19,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-20 13:54:19,992 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 744 flow. Second operand 3 states and 1138 transitions. [2024-11-20 13:54:19,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 852 flow [2024-11-20 13:54:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 363 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:19,996 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 748 flow [2024-11-20 13:54:19,997 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-20 13:54:19,997 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:19,998 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 748 flow [2024-11-20 13:54:19,998 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-20 13:54:19,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:19,998 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-20 13:54:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 13:54:19,998 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-20 13:54:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 911133796, now seen corresponding path program 1 times [2024-11-20 13:54:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083296319] [2024-11-20 13:54:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:20,029 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-20 13:54:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083296319] [2024-11-20 13:54:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083296319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:20,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:20,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057759426] [2024-11-20 13:54:20,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:20,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:20,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:20,042 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-20 13:54:20,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:20,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:20,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:20,383 INFO L124 PetriNetUnfolderBase]: 528/2947 cut-off events. [2024-11-20 13:54:20,383 INFO L125 PetriNetUnfolderBase]: For 254/390 co-relation queries the response was YES. [2024-11-20 13:54:20,413 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-20 13:54:20,423 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-20 13:54:20,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 828 flow [2024-11-20 13:54:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-20 13:54:20,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-20 13:54:20,426 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 748 flow. Second operand 3 states and 1128 transitions. [2024-11-20 13:54:20,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 828 flow [2024-11-20 13:54:20,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 357 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:20,429 INFO L231 Difference]: Finished difference. Result has 356 places, 349 transitions, 748 flow [2024-11-20 13:54:20,430 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-20 13:54:20,430 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:20,430 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 349 transitions, 748 flow [2024-11-20 13:54:20,431 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-20 13:54:20,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:20,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:54:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 13:54:20,431 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-20 13:54:20,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1204443032, now seen corresponding path program 1 times [2024-11-20 13:54:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657125946] [2024-11-20 13:54:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:20,460 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-20 13:54:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657125946] [2024-11-20 13:54:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657125946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688637669] [2024-11-20 13:54:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:20,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:20,473 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-20 13:54:20,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:20,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:20,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:20,978 INFO L124 PetriNetUnfolderBase]: 712/3261 cut-off events. [2024-11-20 13:54:20,978 INFO L125 PetriNetUnfolderBase]: For 341/399 co-relation queries the response was YES. [2024-11-20 13:54:21,011 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-20 13:54:21,025 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-20 13:54:21,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 834 flow [2024-11-20 13:54:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-20 13:54:21,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-20 13:54:21,028 INFO L175 Difference]: Start difference. First operand has 356 places, 349 transitions, 748 flow. Second operand 3 states and 1129 transitions. [2024-11-20 13:54:21,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 834 flow [2024-11-20 13:54:21,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:21,033 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 746 flow [2024-11-20 13:54:21,033 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-20 13:54:21,034 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-20 13:54:21,034 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 746 flow [2024-11-20 13:54:21,034 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-20 13:54:21,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:21,035 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-20 13:54:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 13:54:21,035 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-20 13:54:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -605340477, now seen corresponding path program 1 times [2024-11-20 13:54:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022777512] [2024-11-20 13:54:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:21,077 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-20 13:54:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022777512] [2024-11-20 13:54:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022777512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034310493] [2024-11-20 13:54:21,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:21,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:21,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:21,089 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-20 13:54:21,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:21,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:21,589 INFO L124 PetriNetUnfolderBase]: 433/3145 cut-off events. [2024-11-20 13:54:21,589 INFO L125 PetriNetUnfolderBase]: For 210/326 co-relation queries the response was YES. [2024-11-20 13:54:21,620 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-20 13:54:21,631 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-20 13:54:21,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 846 flow [2024-11-20 13:54:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-20 13:54:21,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-20 13:54:21,634 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 746 flow. Second operand 3 states and 1137 transitions. [2024-11-20 13:54:21,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 846 flow [2024-11-20 13:54:21,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 360 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:21,639 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 750 flow [2024-11-20 13:54:21,639 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-20 13:54:21,639 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-20 13:54:21,639 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 750 flow [2024-11-20 13:54:21,640 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-20 13:54:21,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:21,640 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-20 13:54:21,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 13:54:21,640 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-20 13:54:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1406560618, now seen corresponding path program 1 times [2024-11-20 13:54:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501264077] [2024-11-20 13:54:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:21,675 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-20 13:54:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501264077] [2024-11-20 13:54:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501264077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961606810] [2024-11-20 13:54:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:21,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:21,687 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-20 13:54:21,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:21,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:22,042 INFO L124 PetriNetUnfolderBase]: 542/3144 cut-off events. [2024-11-20 13:54:22,043 INFO L125 PetriNetUnfolderBase]: For 272/318 co-relation queries the response was YES. [2024-11-20 13:54:22,069 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-20 13:54:22,077 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-20 13:54:22,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 851 flow [2024-11-20 13:54:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-20 13:54:22,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-20 13:54:22,079 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 750 flow. Second operand 3 states and 1137 transitions. [2024-11-20 13:54:22,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 851 flow [2024-11-20 13:54:22,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:22,083 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 756 flow [2024-11-20 13:54:22,083 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-20 13:54:22,084 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:22,084 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 756 flow [2024-11-20 13:54:22,084 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-20 13:54:22,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:22,084 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-20 13:54:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 13:54:22,085 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-20 13:54:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1175845953, now seen corresponding path program 1 times [2024-11-20 13:54:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966615321] [2024-11-20 13:54:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:22,112 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-20 13:54:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966615321] [2024-11-20 13:54:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966615321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:22,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:22,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496152485] [2024-11-20 13:54:22,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:22,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-20 13:54:22,124 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-20 13:54:22,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:22,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-20 13:54:22,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:22,549 INFO L124 PetriNetUnfolderBase]: 821/3691 cut-off events. [2024-11-20 13:54:22,549 INFO L125 PetriNetUnfolderBase]: For 436/461 co-relation queries the response was YES. [2024-11-20 13:54:22,591 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-20 13:54:22,603 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-20 13:54:22,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 841 flow [2024-11-20 13:54:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-20 13:54:22,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-20 13:54:22,605 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 756 flow. Second operand 3 states and 1129 transitions. [2024-11-20 13:54:22,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 841 flow [2024-11-20 13:54:22,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:54:22,609 INFO L231 Difference]: Finished difference. Result has 356 places, 347 transitions, 756 flow [2024-11-20 13:54:22,610 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-20 13:54:22,610 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-20 13:54:22,610 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 756 flow [2024-11-20 13:54:22,611 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-20 13:54:22,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:54:22,611 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-20 13:54:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 13:54:22,611 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-20 13:54:22,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:54:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash -125379082, now seen corresponding path program 1 times [2024-11-20 13:54:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:54:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898827059] [2024-11-20 13:54:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:54:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:54:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:54:22,642 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-20 13:54:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:54:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898827059] [2024-11-20 13:54:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898827059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:54:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:54:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:54:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025744841] [2024-11-20 13:54:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:54:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:54:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:54:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:54:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:54:22,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-20 13:54:22,652 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-20 13:54:22,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:54:22,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-20 13:54:22,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:54:23,053 INFO L124 PetriNetUnfolderBase]: 609/3532 cut-off events. [2024-11-20 13:54:23,054 INFO L125 PetriNetUnfolderBase]: For 401/426 co-relation queries the response was YES. [2024-11-20 13:54:23,078 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-20 13:54:23,079 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-11-20 13:54:23,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 853 flow [2024-11-20 13:54:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:54:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:54:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-20 13:54:23,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-20 13:54:23,081 INFO L175 Difference]: Start difference. First operand has 356 places, 347 transitions, 756 flow. Second operand 3 states and 1136 transitions. [2024-11-20 13:54:23,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 853 flow [2024-11-20 13:54:23,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:54:23,084 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2024-11-20 13:54:23,084 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-20 13:54:23,085 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-20 13:54:23,085 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2024-11-20 13:54:23,085 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-20 13:54:23,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-20 13:54:23,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-20 13:54:23,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-20 13:54:23,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-20 13:54:23,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-20 13:54:23,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-20 13:54:23,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-20 13:54:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 13:54:23,092 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-20 13:54:23,096 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:54:23,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:54:23,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:54:23 BasicIcfg [2024-11-20 13:54:23,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:54:23,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:54:23,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:54:23,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:54:23,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:13" (3/4) ... [2024-11-20 13:54:23,101 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 13:54:23,103 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-20 13:54:23,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-20 13:54:23,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-20 13:54:23,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-20 13:54:23,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-20 13:54:23,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-20 13:54:23,110 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-20 13:54:23,111 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 13:54:23,111 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 13:54:23,111 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 13:54:23,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:54:23,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 13:54:23,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:54:23,178 INFO L158 Benchmark]: Toolchain (without parser) took 10468.52ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.1MB in the beginning and 919.3MB in the end (delta: -800.3MB). Peak memory consumption was 212.0MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,178 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:54:23,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.20ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 103.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,179 INFO L158 Benchmark]: Boogie Preprocessor took 39.15ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,179 INFO L158 Benchmark]: RCFGBuilder took 497.83ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 72.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,179 INFO L158 Benchmark]: TraceAbstraction took 9562.39ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 71.6MB in the beginning and 925.6MB in the end (delta: -854.1MB). Peak memory consumption was 692.3MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,179 INFO L158 Benchmark]: Witness Printer took 77.89ms. Allocated memory is still 1.2GB. Free memory was 925.6MB in the beginning and 919.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:54:23,180 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.09ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.20ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 103.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.15ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.83ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 72.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9562.39ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 71.6MB in the beginning and 925.6MB in the end (delta: -854.1MB). Peak memory consumption was 692.3MB. Max. memory is 16.1GB. * Witness Printer took 77.89ms. Allocated memory is still 1.2GB. Free memory was 925.6MB in the beginning and 919.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, 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.0s 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.0s 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-20 13:54:23,196 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